1. H. V. Aho and D. Lee. Storing a dynamic sparse table. In Proc. of the 27th IEEE Ann. Symp. on Foundations of Computer Science, pages 55–60. IEEE, 1986.
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. G. Brassard and S. Kannan. The generation of random permutations on the fly. Inform. Proc. Letters, 28:207–212, 1988.
4. 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.
5. M. Dietzfelbinger and F. Meyer auf der Heide. An optimal parallel dictionary. In Proc. of the 1989 ACM Symp. on Parallel Algorithms and Architectures, pages 360–368, 1989. (Revised version to appear in Information and Computation).