✦ LIBER ✦

Lower bounds for randomized algorithms for online chain partitioning

✍ Scribed by Claire Mathieu; Olga Ohrimenko

Book ID: 116577121
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 159 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.05.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for randomized list update

A lower bound for randomized list update algorithms

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

Lower complexity bounds for interpolatio

Lower complexity bounds for interpolation algorithms

✍ Nardo Giménez; Joos Heintz; Guillermo Matera; Pablo Solernó 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 462 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

The Random Adversary: A Lower-Bound Tech

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

✍ MacKenzie, Philip D. 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 342 KB

Lower Bounds for Randomized Mutual Exclu

Lower Bounds for Randomized Mutual Exclusion

✍ Kushilevitz, Eyal; Mansour, Yishay; Rabin, Michael O.; Zuckerman, David 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

Proving relative lower bounds for increm

Proving relative lower bounds for incremental algorithms

✍ A. Michael Berman; Marvin C. Paull; Barbara G. Ryder 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 1018 KB