Author:
Niedermeier Rolf,Rossmanith Peter
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal on Computing, 15(1):87–97, 1986.
2. M. Dietzfelbinger, M. Kutyłowski, and R. Reischuk. Exact time bounds for computing boolean functions on PRAMs without simultaneous writes. In Proc. of 2d SPAA, pages 125–135, 1990.
3. P. Dymond and W. L. Ruzzo. Parallel RAMs with owned global memory and deterministic language recognition. In Proc. of 13th ICALP, number 226 in LNCS, pages 95–104. Springer-Verlag, 1986.
4. F. E. Fich. The complexity of computation on the parallel random access machine. In J. H. Reif, editor, Synthesis of Parallel Algorithms, chapter 20, pages 843–900. Morgan Kaufmann Publishers, 1993.
5. F. E. Fich and A. Wigderson. Toward understanding exclusive read. SIAM Journal on Computing, 19(4):718–727, 1990.