Time Complexity of Boolean Functions on CREW PRAM s
- 1 October 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (5) , 824-833
- https://doi.org/10.1137/0220051
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1991
- Properties of complexity measures for PRAMs and WRAMsTheoretical Computer Science, 1986
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- Routing, merging, and sorting on parallel models of computationJournal of Computer and System Sciences, 1985
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978