Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines

Johannes A. La Poutré. Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA. pages 34-44, ACM, 1990.

@inproceedings{Poutre90,
  title = {Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines},
  author = {Johannes A. La Poutré},
  year = {1990},
  researchr = {https://researchr.org/publication/Poutre90},
  cites = {0},
  citedby = {0},
  pages = {34-44},
  booktitle = {Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA},
  publisher = {ACM},
}