1. R. J. Anderson and G. L. Miller. Optical communication for pointer based algorithms. Technical Report CRI 88-14, University of Southern California, Comp. Sci. Dept., 1988.
2. H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 50–61, 1991.
3. H. Bast and T. Hagerup. Personal communication. 1991.
4. J. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18:143–154, 1979.
5. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report 77, Universität-GH-Paderborn, Fachbereich Mathematik/Informatik, Jan. 1991. Revised Version of the paper of the same title that appeared in Proc. of the 29th IEEE Ann. Symp. on Foundations of Computer Science, pages 524–531, 1988.