✦ LIBER ✦

Bit-Probe Lower Bounds for Succinct Data Structures

✍ Scribed by Viola, Emanuele

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Succinct data structures for assembling

✍ Conway, T. C.; Bromage, A. J. 📂 Article 📅 2011 🏛 Oxford University Press 🌐 English ⚖ 295 KB

Lower Bounds for Dynamic Data Structures

✍ A. M. Ben-Amram and Z. Galil 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 269 KB

Lower bounds on the efficiency of transf

✍ Kurt Mehlhorn 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 950 KB

Succinct and I/O Efficient Data Structur

✍ Craig Dillabaugh; Meng He; Anil Maheshwari 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 764 KB

A comparison study of succinct data stru

✍ Putnam, Patrick P; Zhang, Ge; Wilsey, Philip A 📂 Article 📅 2013 🏛 BioMed Central 🌐 English ⚖ 282 KB

Lower Bounds in a Parallel Model without

✍ Mulmuley, Ketan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 634 KB