MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Bloomier filter an efficient data structure for static support lookup tables." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
by Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal, Oh Boy — 2004 — In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
…The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables ∗ Abstract…
Cited by 17 (0 self) – Add To MetaCart

The bloomier filter: An efficient data structure for static support lookup tables
by Bernard Chazelley, Joe Kilianz, Ronitt Rubinfeldz, Ayellet Talx — 2004 — In Proc of SODA
… The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables \Lambda…
Cited by 1 (0 self) – Add To MetaCart

Simple and space-efficient minimal perfect hash functions
by Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani — 2007 — In Proc. of the 10th Intl. Workshop on Data Structures and Algorithms
… Filter: An Efficient Data Structure for Static Support Lookup Tables, by Chazelle et al., Proceedings…
Cited by 6 (4 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB