Pages that link to "Item:Q5402545"
From MaRDI portal
The following pages link to A unified approach to models of synchronous parallel machines (Q5402545):
Displayed 20 items.
- An optimal parallel connectivity algorithm (Q797997) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Optical computing (Q1036535) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Optimal parallel randomized algorithms for sparse addition and identification (Q1103402) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- \(\varepsilon\)-productions in context-free grammars (Q1148693) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- Division in idealized unit cost RAMs (Q1159982) (← links)
- The maximum flow problem is log space complete for P (Q1165000) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Unambiguity of circuits (Q1208408) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- On the parallel complexity of discrete relaxation in constraint satisfaction networks (Q2638780) (← links)
- Associative processors as a tool for maximal parallelism (Q3042378) (← links)
- Parallel random access machines with powerful instruction sets (Q3959429) (← links)