Pages that link to "Item:Q3802607"
From MaRDI portal
The following pages link to The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607):
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)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Simulations among concurrent-write PRAMs (Q1104097) (← links)
- Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
- Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014) (← links)
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
