Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
87
Voted
STACS
2009
Springer
135
views
Theoretical Computer Science
»
more
STACS 2009
»
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
15 years 10 months ago
Download
drops.dagstuhl.de
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. ...
claim paper
Read More »