Selected papers that cite this one
- Peter Bro Miltersen. Lower bounds for Union-Split-Find related problems on random access machines. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 625-634, Montréal, Québec, Canada, 23-25 May 1994.