✦ LIBER ✦

The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms

✍ Scribed by MacKenzie, Philip D.

Book ID: 118178111
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 342 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539791224030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Randomized Consensus un

Lower Bounds for Randomized Consensus under a Weak Adversary

✍ Attiya, Hagit; Censor-Hillel, Keren 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 277 KB

A lower bound for randomized list update

A lower bound for randomized list update algorithms

✍ Boris Teia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A lower bound for randomized on-line sch

A lower bound for randomized on-line scheduling algorithms

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Lower bounds for randomized algorithms f

Lower bounds for randomized algorithms for online chain partitioning

✍ Claire Mathieu; Olga Ohrimenko 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Transforming comparison model lower boun

Transforming comparison model lower bounds to the parallel-random-access-machine

✍ Dany Breslauer; Artur Czumaj; Devdatt P. Dubhashi; Friedhelm Meyer auf der Heide 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 758 KB

We provide general transformations of lower bounds in Valiant's parallel-comparison-decision-tree model to lower bounds in the priority concurrent-read concurrent-write parallel-random-access-machine model. The proofs rely on standard Ramsey-theoretic arguments that simplify the structure of the com

A lower bound for randomized algebraic d

A lower bound for randomized algebraic decision trees

✍ Dima Grigoriev; Marek Karpinski; Friedhelm Meyer auf der Heide; Roman Smolensky 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 974 KB