Active Bibliography

5 MORE HASTE, LESS WASTE: LOWERING THE REDUNDANCY IN FULLY INDEXABLE DICTIONARIES – Roberto Grossi, et al. - 2009
8 Cell-Probe Lower Bounds for Succinct Partial Sums – Mihai Pǎtrascu, Emanuele Viola - 2009
2 Upper and Lower Bounds for Text Indexing Data Structures – Alexander Golynski
7 Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation – Yuriy Arbitman, Moni Naor, Gil Segev - 2010
Theory and Practice of Monotone Minimal Perfect Hashing DJAMAL BELAZZOUGUI – Université Paris Diderot–paris, Paolo Boldi
IBM Almaden – unknown authors - 2009
3 LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋆ – Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
19 Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays – Johannes Fischer, Volker Heun - 2009
51 K.: Practical Entropy-Compressed Rank/Select Dictionary – Daisuke Okanohara, Kunihiko Sadakane - 2007
13 Succinct Data Structures for Retrieval and Approximate Membership – Martin Dietzfelbinger, Rasmus Pagh
42 S.S.: Succinct indexes for strings, binary relations, and multi-labeled trees – Jérémy Barbay, Meng He, J. Ian Munro - 2007
33 Fully-functional succinct trees – Kunihiko Sadakane, Gonzalo Navarro - 2010
41 A simple optimal representation for balanced parentheses – Richard F. Geary, Naila Rahman, Rajeev Raman - 2004
173 Compressed full-text indexes – Gonzalo Navarro, Veli Mäkinen - 2007
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
On Dynamic Range Reporting in One Dimension Christian Worm Mortensen ∗ IT U. Copenhagen – Rasmus Pagh - 2005
Some Experimental Results on Data Structure Compression – n.n.
Entropy-Bounded Representation of Point Grids ✩ – Arash Farzan A, Travis Gagie B, Gonzalo Navarro C
How to Approximate A Set Without Knowing Its Size In Advance – Rasmus Pagh, Gil Segev, Udi Wieder