Towards a complexity theory of synchronous parallel computation
From MaRDI portal
Cited in
(26)- Finding optimal subgraphs by local search
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- Parallel pointer machines
- The complexity of graph languages generated by hyperedge replacement
- A complexity theory of efficient parallel algorithms
- Routing, merging, and sorting on parallel models of computation
- Weak parallel machines: a new class of physically feasible parallel machine models
- Fast parallel absolute irreducibility testing
- Graph layout problems
- A note on strategy elimination in bimatrix games
- An introduction to parallelism in combinatorial optimization
- Array processing machines: an abstract model
- Parallel models of computation: An introductory survey
- Expected parallel time and sequential space complexity of graph and digraph problems
- Efficient algorithms for parallel sorting on mesh multicomputers
- Speedups of deterministic machines by synchronous parallel machines
- Complexity theory of parallel time and hardware
- Oracle branching programs and Logspace versus \(P^*\)
- Parallel algorithms for solvable permutation groups
- On languages accepted with simultaneous complexity bounds and their ranking problem
- Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines
- Parallel evaluation of arithmetic circuits
- On nondeterminism in parallel computation
- The complexity of computing the number of strings of given length in context-free languages
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
- Data independence of read, write, and control structures in PRAM computations
This page was built for publication: Towards a complexity theory of synchronous parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158753)
