The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Prabhakar Ragde / rank | |||
| Property / author | |||
| Property / author: Prabhakar Ragde / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0401040 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W38294843 / rank | |||
Normal rank | |||
Latest revision as of 01:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ |
scientific article |
Statements
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (English)
0 references
1988
0 references
parallel random access machines
0 references
element distinctness
0 references
lower bound
0 references
PRAM
0 references
model of parallel computation
0 references
