Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- 1 February 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (1) , 88-99
- https://doi.org/10.1137/0220005
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Parallel speedup of sequential machines: a defense of parallel computation thesisACM SIGACT News, 1986
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- On Parallel SearchingSIAM Journal on Computing, 1985
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functionsInformation and Control, 1982
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978