Selected papers that cite this one
- Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, and Sven Skyum. Dynamic word problems. Journal of the ACM, 44(2):257-271, March 1997.
- 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.
- Roberto De Prisco and Giuseppe Persiano. Characteristic inequalities for binary trees. Information Processing Letters, 53(4):201-207, 24 February 1995.
- John H. Reif and Stephen R. Tate. On dynamic algorithms for algebraic problems. Journal of Algorithms, 22(2):347-371, February 1997.