Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

48

Voted

CORR
2008
Springer

65views Education» more CORR 2008»

Succinct Data Structures for Retrieval and Approximate Membership

15 years 2 months ago

Succinct Data Structures for Retrieval and Approximate Membership

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

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)