✦ LIBER ✦

Proving relative lower bounds for incremental algorithms

✍ Scribed by A. Michael Berman; Marvin C. Paull; Barbara G. Ryder

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simplified Drift Analysis for Proving Lo

✍ Pietro S. Oliveto; Carsten Witt 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 497 KB

Lower complexity bounds for interpolatio

✍ Nardo Giménez; Joos Heintz; Guillermo Matera; Pablo Solernó 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Lower bounds for the relative greedy alg

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

Lower bounds for sampling algorithms for

✍ Ran Canetti; Guy Even; Oded Goldreich 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Lower bounds for randomized algorithms f

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

Lower bounds¶for the relative Lusternik–

✍ Pierre-Marie Moyaux 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 69 KB