Journal of the ACM Bibliography

Selected papers that cite this one

• M. Adler. Asynchronous shared memory search structures. Theory of Computing Systems, 31(4):377-401, July/August 1998.

• Arne Andersson, Peter Bro Miltersen, Søren Riis, and Mikkel Thorup. Static dictionaries on AC^0 RAMs: Query time Theta(sqrt(log n/log log n)) is necessary and sufficient. In 37th Annual Symposium on Foundations of Computer Science, pages 441-450, Burlington, Vermont, 14-16 October 1996. IEEE.

• Binay K. Bhattacharya and Sandeep Sen. On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm. Journal of Algorithms, 25(1):177-193, October 1997.

• Bernard Chazelle. Computational geometry: A restrospective. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 75-94, Montréal, Québec, Canada, 23-25 May 1994.

• G. N. Frederickson. Searching among intervals and compact routing tables. Algorithmica, 15(5):448-466, May 1996.

• Joseph Gil, Friedhelm Meyer auf der Heide, and Avi Wigderson. The tree model for hashing: Lower and upper bounds. SIAM Journal on Computing, 25(5):936-955, October 1996.

• Peter Bro Miltersen. Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 556-563, San Francisco, California, 25-27 January 1998.

• Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 57(1):37-49, August 1998.

• Sandeep Sen. Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems. Theoretical Computer Science, 188(1-2):59-78, 30 November 1997.

• R. Wenger. Randomized quickhull. Algorithmica, 17(3):322-329, March 1997.

• Andrew C. Yao and Frances F. Yao. Dictionary look-up with one error. Journal of Algorithms, 25(1):194-202, October 1997.

Shortcuts: