Journal of the ACM Bibliography

Selected papers that cite this one

• Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, and Gábor Tardos. Is linear hashing good? In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 465-474, El Paso, Texas, 4-6 May 1997.

• N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16(4/5):434-449, October/November 1996.

• Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. Journal of the ACM, 42(4):844-856, July 1995.

• Noga Alon, Raphy Yuster, and Uri Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 326-335, Montréal, Québec, Canada, 23-25 May 1994.

• Arne Andersson. Faster deterministic sorting and searching in linear space. In 37th Annual Symposium on Foundations of Computer Science, pages 135-141, Burlington, Vermont, 14-16 October 1996. IEEE.

• 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.

• 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.

• Yosi Ben-Asher. Optical routing in meshes using the duplication model. Journal of Parallel and Distributed Computing, 41(1):36-41, 25 February 1997.

• Mark de Berg, Marc van Kreveld, and Jack Snoeyink. Two- and three-dimensional point location in rectangular subdivisions. Journal of Algorithms, 18(2):256-277, March 1995.

• Dany Breslauer. Dictionary-matching on unbounded alphabets: Uniform length dictionaries. Journal of Algorithms, 18(2):278-295, March 1995.

• Andrei Z. Broder, Anna R. Karlin, Prabhakar Raghavan, and Eli Upfal. Trading space for time in undirected s-t connectivity. SIAM Journal on Computing, 23(2):324-334, April 1994.

• Nader Bshouty and Lisa Hellerstein. Attribute-efficient learning in query and mistake-bound models. Journal of Computer and System Sciences, 56(3):310-319, April 1998.

• Zbigniew J. Czech, George Havas, and Bohdan S. Majewski. Perfect hashing. Theoretical Computer Science, 182(1-2):1-143, 15 August 1997. Fundamental Study.

• Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. An optimal parallel dictionary. Information and Computation, 102(2):196-217, February 1993.

• Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, and Martti Penttonen. A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms, 25(1):19-51, October 1997.

• 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.

• Tomàs Feder, Eyal Kushilevitz, Moni Naor, and Noam Nisan. Amortized communication complexity. SIAM Journal on Computing, 24(4):736-750, August 1995.

• Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel. Nonoblivious hashing. Journal of the ACM, 39(4):764-782, October 1992.

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

• Phillip B. Gibbons, Yossi Matias, and Vijaya Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 53(3):417-442, December 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.

• Joseph Gil and Yossi Matias. Simple fast parallel hashing by oblivious execution. SIAM Journal on Computing, 27(5):1348-1375, October 1998.

• Torben Hagerup. Sorting and searching on the word PRAM. In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 366-398, Paris France, 25-27 February 1998. Springer.

• Torben Hagerup. Fast deterministic processor allocation. Journal of Algorithms, 18(3):629-649, May 1995.

• K. T. Herley. Representing shared data on distributed-memory parallel computers. Mathematical Systems Theory, 29(2):111-156, March/April 1996.

• Piotr Indyk. Deterministic superimposed coding with applications to pattern matching. In 38th Annual Symposium on Foundations of Computer Science, pages 127-136, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Samir Khuller and Yossi Matias. A simple randomized sieve algorithm for the closest-pair problem. Information and Computation, 118(1):34-37, April 1995.

• Nathan Linial and Ori Sasson. Non-expansive hashing. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 509-518, Philadelphia, Pennsylvania, 22-24 May 1996.

• 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.

• 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. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 103-111, Las Vegas, Nevada, 29 May-1 June 1995.

• 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.

• Dan E. Willard. Application of range query theory to relational data base join and selection operations. Journal of Computer and System Sciences, 52(1):157-169, February 1996.

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

Shortcuts: