New lower bounds for parallel computation
From MaRDI portal
Recommendations
- Resource bounds for parallel computation of threshold and symmetric functions
- Limits on the power of concurrent-write parallel machines
- scientific article; zbMATH DE number 4047091
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
Cited in
(27)- Limits on the power of concurrent-write parallel machines
- Some considerations about NPRIORITY(1) without ROM
- PRAMs with variable word-size
- The parallel complexity of integer prefix summation
- Lower bounds for randomized exclusive write PRAMs
- Removing Ramsey theory: Lower bounds with smaller domain size
- Parallelizing time with polynomial circuits
- Transforming comparison model lower bounds to the parallel-random-access-machine
- An insight on PRAM computational bounds
- Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- Lower time bounds for solving linear diophantine equations on several parallel computational models
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- The Complexity of Parallel Sorting
- scientific article; zbMATH DE number 4045149 (Why is no real title available?)
- scientific article; zbMATH DE number 4047091 (Why is no real title available?)
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
- scientific article; zbMATH DE number 1189246 (Why is no real title available?)
- Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
- Lower Bounds in a Parallel Model without Bit Operations
- The CREW PRAM Complexity of Modular Inversion
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
- Optimal bounds for decision problems on the CRCW PRAM
- scientific article; zbMATH DE number 4119627 (Why is no real title available?)
- Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks
- Resource bounds for parallel computation of threshold and symmetric functions
- Large parallel machines can be extremely slow for small problems
This page was built for publication: New lower bounds for parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710687)
