Pages that link to "Item:Q1158753"
From MaRDI portal
The following pages link to Towards a complexity theory of synchronous parallel computation (Q1158753):
Displaying 22 items.
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Efficient algorithms for parallel sorting on mesh multicomputers (Q1193763) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Parallel pointer machines (Q2366720) (← links)
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H) (Q2638964) (← links)
