Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
- 1 June 1995
- journal article
- Published by Springer Nature in computational complexity
- Vol. 5 (2) , 113-131
- https://doi.org/10.1007/bf01268141
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Using approximation algorithms to design parallel algorithms that may ignore processor allocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Towards a theory of nearly constant time parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- INFORMATION BROADCASTING BY EXCLUSIVE-READ PRAMSParallel Processing Letters, 1994
- Exact lower time bounds for computing Boolean functions on CREW PRAMsJournal of Computer and System Sciences, 1994
- Limits on the power of parallel random access machines with weak forms of write conflict resolutionLecture Notes in Computer Science, 1993
- Fast and optimal simulations between CRCW PRAMsPublished by Springer Nature ,1992
- Fast and reliable parallel hashingPublished by Association for Computing Machinery (ACM) ,1991
- Parallel Merge SortSIAM Journal on Computing, 1988
- Relations between Concurrent-Write Models of Parallel ComputationSIAM Journal on Computing, 1988
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986