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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
10
click to vote
CORR
2008
Springer
favorite
Email
discuss
report
65
views
Education
»
more
CORR 2008
»
Succinct Data Structures for Retrieval and Approximate Membership
13 years 10 months ago
Download
www.itu.dk
Martin Dietzfelbinger, Rasmus Pagh
Real-time Traffic
CORR 2008
|
Education
|
claim paper
Related Content
»
Bitprobe lower bounds for succinct data structures
»
Colored Range Queries and Document Retrieval
»
Beyond bloom filters from approximate membership checks to approximate state machines
»
ErrorCorrecting Data Structures
»
Succinct summarization of transactional databases an overlapped hyperrectangle scheme
»
Type less find more fast autocompletion search with a succinct index
»
Finding Range Minima in the Middle Approximations and Applications
»
A Simple Alphabetindependent Fmindex
»
The Bloomier filter an efficient data structure for static support lookup tables
more »
Post Info
More Details (n/a)
Added
09 Dec 2010
Updated
09 Dec 2010
Type
Journal
Year
2008
Where
CORR
Authors
Martin Dietzfelbinger, Rasmus Pagh
Comments
(0)
Researcher Info
Education Study Group
Computer Vision