Selected papers that cite this one
- Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing (preliminary version). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 238-247, Las Vegas, Nevada, 29 May-1 June 1995.
- Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 593-602, Montréal, Québec, Canada, 23-25 May 1994.
- Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23(4):738-761, August 1994.
- Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel. Nonoblivious hashing. Journal of the ACM, 39(4):764-782, October 1992.
- Philippe Jacquet and Wojciech Szpankowski. Analytical depoissonization and its applications. Theoretical Computer Science, 201(1-2):1-62, 6 July 1998. Fundamental Study.
- Philip D. MacKenzie and Quentin F. Stout. Ultrafast expected time parallel algorithms. Journal of Algorithms, 26(1):1-33, January 1998.
- D. B. Skillicorn. A parallel tree difference algorithm. Information Processing Letters, 60(5):231-235, 9 December 1996.