Pages that link to "Item:Q919822"
From MaRDI portal
The following pages link to Incomparability in parallel computation (Q919822):
Displaying 7 items.
- Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- The strongest model of computation obeying 0-1 Principles (Q633766) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Separation and lower bounds for ROM and nondeterministic models of parallel computation (Q1098633) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607) (← links)