Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1), 87-97
- https://doi.org/10.1137/0215006
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- 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