1. H. Bast and T. Hagerup, Fast and Reliable Parallel Hashing, manuscript. A preliminary version appeared in Proc. 3rd SPAA (1991), pp. 50–61.
2. O. Berkman and U. Vishkin, Recursive *-Tree Parallel Data-Structure, in Proc. 30th FOCS (1989), pp. 196–202.
3. R. Cole and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, in Proc. 18th STOC (1986), pp. 206–219.
4. M. Dietzfelbinger and F. Meyer auf der Heide, Dynamic Hashing in Real Time, in Informatik: Festschrift zum 60. Geburtstag von Günter Hotz (1992), Teubner-Texte zur Informatik, Band 1, Teubner, Stuttgart (a preliminary version appeared in Proc. 17th ICALP (1990), Springer LNCS, Vol. 443, pp. 6–19).
5. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a Sparse Table with O(1) Worst Case Access Time, J. ACM
31 (1984), pp. 538–544.