Limits on the power of parallel random access machines with weak forms of write conflict resolution-Reference-Cited by-同舟云学术

Limits on the power of parallel random access machines with weak forms of write conflict resolution

Published:1993 Issue: Volume: Page:386-397
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fich Faith E.,Impagliazzo Russell,Kapron Bruce,King Valerie,Kutylowski Miroslaw

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56503-5_39

Reference14 articles.

1. A. Borodin, J. Hopcroft, M. Paterson, L. Ruzzo, and M. Tompa, “Observations Concerning Synchronous Parallel Models of Computation”, manuscript, 1980.

2. S. Cook, C. Dwork, and R. Reischuk, “Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes”, SIAM J. Comput., volume 15, 1986, pages 87–97.

3. M. Dietzfelbinger, M. Kutyłowski, and R. Reischuk, “Exact Time Bounds for Computing Boolean Functions without Simultaneous Writes”, Proc. Second Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pages 125–135.

4. D. Eppstein and Z. Galil, “Parallel Algorithmic Techniques for Combinatorial Computing”, Ann. Rev. Comput. Sci., volume 3, 1988, pages 233–283.

5. F. Fich, P. Ragde, and A. Wigderson, “Relations Between Concurrent-Write Models of Parallel Computation”, SIAM J. Comput., volume 17, 1988, pages 606–627.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing OR on a randomized fixed adversary CRCW PRAM;Information Processing Letters;1997-08

2. ERCW PRAMs and optical communication;Lecture Notes in Computer Science;1996

3. Retrieval of scattered information by EREW, CREW, and CRCW PRAMs;Computational Complexity;1995-06