Technical Report: Modeling Average False Positive Rates of Recycling Bloom Filters
Fuente:
arXiv
Saved in:
| Main Authors: | Dozier, Kahlil, Salamatian, Loqman, Rubenstein, Dan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Blocked Bloom Filters with Choices
by: Schmitz, Johanna Elena, et al.
Published: (2025)
by: Schmitz, Johanna Elena, et al.
Published: (2025)
Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints
by: Walther, Paul, et al.
Published: (2025)
by: Walther, Paul, et al.
Published: (2025)
Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
by: Sato, Atsuki, et al.
Published: (2024)
by: Sato, Atsuki, et al.
Published: (2024)
Daisy Bloom Filters
by: Bercea, Ioana O., et al.
Published: (2022)
by: Bercea, Ioana O., et al.
Published: (2022)
Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)
by: Almashaqbeh, Ghada, et al.
Published: (2024)
Learned LSM-trees: Two Approaches Using Learned Bloom Filters
by: Fidalgo, Nicholas, et al.
Published: (2025)
by: Fidalgo, Nicholas, et al.
Published: (2025)
A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
by: Shishir, Fairuz Shadmani, et al.
Published: (2024)
by: Shishir, Fairuz Shadmani, et al.
Published: (2024)
Technical Report: Toward Applying Quantum Computing to Network Verification
by: Dozier, Kahlil, et al.
Published: (2024)
by: Dozier, Kahlil, et al.
Published: (2024)
Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
by: Sato, Atsuki, et al.
Published: (2025)
by: Sato, Atsuki, et al.
Published: (2025)
Average-Distortion Sketching
by: Bao, Yiqiao, et al.
Published: (2024)
by: Bao, Yiqiao, et al.
Published: (2024)
Average sensitivity of the Knapsack Problem
by: Kumabe, Soh, et al.
Published: (2024)
by: Kumabe, Soh, et al.
Published: (2024)
Invertible Bloom Lookup Tables with Less Memory and Randomness
by: Fleischhacker, Nils, et al.
Published: (2023)
by: Fleischhacker, Nils, et al.
Published: (2023)
Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
by: Dolev, Shlomi
Published: (2025)
by: Dolev, Shlomi
Published: (2025)
Adaptive Quotient Filters
by: Wen, Richard, et al.
Published: (2024)
by: Wen, Richard, et al.
Published: (2024)
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
by: van Iersel, Leo, et al.
Published: (2026)
by: van Iersel, Leo, et al.
Published: (2026)
Fingerprint Filters Are Optimal
by: Kuszmaul, William, et al.
Published: (2025)
by: Kuszmaul, William, et al.
Published: (2025)
Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)
by: Alman, Josh, et al.
Published: (2024)
A Simple Average-case Analysis of Recursive Randomized Greedy MIS
by: Dalirrooyfard, Mina, et al.
Published: (2026)
by: Dalirrooyfard, Mina, et al.
Published: (2026)
Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)
by: Brown, Nathaniel K., et al.
Published: (2026)
Optimizing Quotient Filters using Graveyard Hashing
by: Quaye, Isabelle, et al.
Published: (2025)
by: Quaye, Isabelle, et al.
Published: (2025)
A Tour of Locality Sensitive Filtering on the Sphere
by: Becchetti, Luca, et al.
Published: (2026)
by: Becchetti, Luca, et al.
Published: (2026)
Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
by: Beretta, Lorenzo, et al.
Published: (2025)
by: Beretta, Lorenzo, et al.
Published: (2025)
Chasing Positive Bodies
by: Bhattacharya, Sayan, et al.
Published: (2023)
by: Bhattacharya, Sayan, et al.
Published: (2023)
The Quasi-Polynomial Low-Degree Conjecture is False
by: Buhai, Rares-Darius, et al.
Published: (2025)
by: Buhai, Rares-Darius, et al.
Published: (2025)
Tree Proof-of-Position Algorithms
by: Kharman, Aida Manzano, et al.
Published: (2024)
by: Kharman, Aida Manzano, et al.
Published: (2024)
Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
by: Karathanasis, Konstantinos, et al.
Published: (2025)
by: Karathanasis, Konstantinos, et al.
Published: (2025)
Sparsifying Sums of Positive Semidefinite Matrices
by: Basu, Arpon, et al.
Published: (2025)
by: Basu, Arpon, et al.
Published: (2025)
How to Train Your Filter: Should You Learn, Stack or Adapt?
by: Sabale, Diandre Miguel, et al.
Published: (2026)
by: Sabale, Diandre Miguel, et al.
Published: (2026)
Time To Replace Your Filter: How Maplets Simplify System Design
by: Bender, Michael A., et al.
Published: (2025)
by: Bender, Michael A., et al.
Published: (2025)
Solving Positive Linear Programs with Differential Privacy
by: Ene, Alina, et al.
Published: (2026)
by: Ene, Alina, et al.
Published: (2026)
Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)
by: Wang, Zeyu, et al.
Published: (2026)
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
by: Lange, Jane, et al.
Published: (2023)
by: Lange, Jane, et al.
Published: (2023)
ε-Cost Sharding: Scaling Hypergraph-Based Static Functions and Filters to Trillions of Keys
by: Vigna, Sebastiano
Published: (2025)
by: Vigna, Sebastiano
Published: (2025)
Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)
by: Szyfelbein, Michał
Published: (2026)
Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
by: Lamprou, Ioannis, et al.
Published: (2025)
by: Lamprou, Ioannis, et al.
Published: (2025)
Aleph Filter: To Infinity in Constant Time
by: Dayan, Niv, et al.
Published: (2024)
by: Dayan, Niv, et al.
Published: (2024)
Smaller and More Flexible Cuckoo Filters
by: Schmitz, Johanna Elena, et al.
Published: (2025)
by: Schmitz, Johanna Elena, et al.
Published: (2025)
Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD
by: Clausecker, Robert, et al.
Published: (2024)
by: Clausecker, Robert, et al.
Published: (2024)
Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
by: Bienkowski, Marcin, et al.
Published: (2026)
by: Bienkowski, Marcin, et al.
Published: (2026)
Similar Items
-
Blocked Bloom Filters with Choices
by: Schmitz, Johanna Elena, et al.
Published: (2025) -
Extending the Applicability of Bloom Filters by Relaxing their Parameter Constraints
by: Walther, Paul, et al.
Published: (2025) -
Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
by: Sato, Atsuki, et al.
Published: (2024) -
Daisy Bloom Filters
by: Bercea, Ioana O., et al.
Published: (2022) -
Adversary Resilient Learned Bloom Filters
by: Almashaqbeh, Ghada, et al.
Published: (2024)