Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 11, 2004

The Bloomier filter: an efficient data structure for static support lookup tables

View Full Paper
Ask AI
Bookmark
Share

Authors

BCBernard ChazellePrinceton UniversityJKJoe KilianHebrew CollegeRRRonitt RubinfeldBerkeley College

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Chazelle et al. (2004) studied this question.

synapsesocial.com/papers/6a7145b4f44fa9f079df0e0ahttps://doi.org/10.5555/982792.982797
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Spectral bloom filters2003 · 394 citations
  2. 2Hash-based IP traceback2001 · 737 citations
  3. 3Expander codes1996 · 950 citations
  4. 4Geographical Region Summary Service for geographical routing2001 · 41 citations
  5. 5Optimal semijoins for distributed database systems1990 · 157 citations