The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms (Q4376188)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms |
scientific article; zbMATH DE number 1116376
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms |
scientific article; zbMATH DE number 1116376 |
Statements
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms (English)
0 references
10 February 1998
0 references
parallel algorithms
0 references
parallel computation
0 references
PRAM model
0 references
randomized parallel algorithms
0 references
expected time
0 references
lower bounds
0 references
load balancing
0 references
0.8708711
0 references
0.8679413
0 references
0 references
0 references
0.8644664
0 references
