An Optimal Bloom Filter Replacement Based on Matrix Solving

2009/01/01 by Ely Porat · 1 citation
Computer Science · Mathematics · #Algorithm #Artificial intelligence #Associative array #Bloom filter #Caching and Content Delivery #Computer science #Cooperative Communication and Network Coding #Data structure #Element (criminal law) #Filter (signal processing) #Hash function #Hash table #Internet Traffic Analysis and Secure E-voting #Mathematics #Perfect hash function #Programming language #Space (punctuation) #String (physics) #Theoretical computer science #Value (mathematics)

paper · doi:10.1007/978-3-642-03351-3_25

crossref issued 2009/01/01 · crossref published 2009/01/01 · crossref published-print 2009/01/01 · openalex publication_date 2009/01/01 · crossref created 2009/08/03 · crossref deposited 2019/05/21 · openalex created_date 2025/10/10 · crossref indexed 2026/02/16 · openalex updated_date 2026/08/04

Citations

• Bloomier Filters: A Second Look
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Network Applications of Bloom Filters: A Survey
• Spectral bloom filters
• A tale of three spelling checkers
• Space/time trade-offs in hash coding with allowable errors
• Summary cache: a scalable wide-area Web cache sharing protocol

Cited by

• Bloom filter [wikipedia]