1. A. Aggarwal, A.K. Chandra, M. Snir, On communication latency in PRAM computations, in: Proc. ACM Symp. on Parallel Algorithms and Architectures, 1989, pp. 11–21.
2. Time bounds for selection;Blum;J. Comput. System Sci.,1972
3. B.S. Chlebus, A. Czumaj, L. Ga̧sieniec, M. Kowaluk, W. Plandowski, Parallel alternating-direction access machine, in: Proc. 21st Internat. Symp. on Mathematical Foundations of Computer Science, 1996, Lecture Notes in Computer Science, Vol. 1113, pp. 267–278.
4. B.S. Chlebus, A. Czumaj, J.F. Sibeyn, Routing on the PADAM: degrees of optimality, in: Proc. Euro-Par’97 Parallel Processing, 1997, Lecture Notes in Computer Science, Vol. 1300, pp. 272–279.
5. M. Dietzfelbinger, F. Meyer auf der Heide, Dynamic hashing in real time, in: J. Buchmann, H. Ganzinger, W.J. Paul (Eds.), Informatik: Festschrift zum 60. Geburtstag von Günter Hotz, B.G. Teuber Verlagsgesellschaft, Leipzig, 1992, pp. 95–119. A preliminary version appeared as: M. Dietzfelbinger, F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, in: Proc. 17th Internat. Colloq. on Automata, Languages and Programming, 1990, pp. 6–19.