Separation and lower bounds for ROM and nondeterministic models of parallel computation
From MaRDI portal
Publication:1098633
DOI10.1016/0890-5401(87)90017-4zbMath0637.68049OpenAlexW1975320892MaRDI QIDQ1098633
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90017-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Some considerations about NPRIORITY(1) without ROM ⋮ Resource bounds for parallel computation of threshold and symmetric functions
Cites Work
- Unnamed Item
- Unnamed Item
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- Trade-Offs between Depth and Width in Parallel Computation
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- Computing connected components on parallel computers
- Finding the maximum, merging, and sorting in a parallel computation model
- An O(logn) parallel connectivity algorithm
This page was built for publication: Separation and lower bounds for ROM and nondeterministic models of parallel computation
