A Lower Bound on the Complexity of the Union-Split-Find Problem - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Kurt Mehlhorn, Stefan Näher, Helmut Alt. A Lower Bound on the Complexity of the Union-Split-Find Problem. SIAM Journal on Computing, 17(6):1093-1102, 1988.

@article{MehlhornNA88,
  title = {A Lower Bound on the Complexity of the Union-Split-Find Problem},
  author = {Kurt Mehlhorn and Stefan Näher and Helmut Alt},
  year = {1988},
  researchr = {https://researchr.org/publication/MehlhornNA88},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {17},
  number = {6},
  pages = {1093-1102},
}

runs on WebDSL