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.

Authors

Johannes A. La Poutré

This author has not been identified. Look up 'Johannes A. La Poutré' in Google