On the public citation graph
InfiniFilter: Expanding Filters to Infinity and Beyond
0 signed · 73 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11841036_61openalex-snapshot
An Improved Construction for Counting Bloom Filters
inferredcites →https://doi.org/10.1080/15427951.2004.10129096openalex-snapshot
Network Applications of Bloom Filters: A Survey
inferredcites →https://doi.org/10.1109/focs.2013.17openalex-snapshot
How to Approximate a Set without Knowing Its Size in Advance
inferredcites →https://doi.org/10.1109/glocom.2007.107openalex-snapshot
A Scalable Bloom Filter for Membership Queries
inferredcites →https://doi.org/10.1109/icdcs.2011.44openalex-snapshot
BloomFlash: Bloom Filter on Flash-Based Storage
inferredcites →https://doi.org/10.1109/icde51399.2021.00087openalex-snapshot
The Logarithmic Dynamic Cuckoo Filter
inferredcites →https://doi.org/10.1109/infcom.2012.6195563openalex-snapshot
The Variable-Increment Counting Bloom Filter
inferredcites →https://doi.org/10.1109/infocom.2006.325openalex-snapshot
Theory and Network Applications of Dynamic Bloom Filters
inferredcites →https://doi.org/10.1109/ojcs.2022.3219631openalex-snapshot
Towards Capacity-Adjustable and Scalable Quotient Filter Design for Packet Classification in Software-Defined Networks
inferredcites →https://doi.org/10.1109/tc.2021.3067713openalex-snapshot
Elastic Bloom Filter: Deletable and Expandable Filter Using Elastic Fingerprints
inferredcites →https://doi.org/10.1109/tnet.2017.2685530openalex-snapshot
TinySet—An Access Efficient Self Adjusting Bloom Filter Construction
inferredcites →https://doi.org/10.1145/1498698.1594230openalex-snapshot
Cache-, hash-, and space-efficient bloom filters
inferredcites →https://doi.org/10.1145/3035918.3035963openalex-snapshot
A General-Purpose Counting Filter
inferredcites →https://doi.org/10.1145/3276980openalex-snapshot
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
inferredcites →https://doi.org/10.1145/3299869.3319903openalex-snapshot
The Log-Structured Merge-Bush & the Wacky Continuum
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/800133.804332openalex-snapshot
Exact and approximate membership testers
inferredcites →https://doi.org/10.14778/3303753.3303757openalex-snapshot
Performance-optimal filtering
inferredcites →https://doi.org/10.21236/ada604306openalex-snapshot
The Design and Implementation of a Log-structured File System
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s41019-024-00265-8openalex-snapshot
Spatio-Temporal Keyword Query Processing Based on Key-Value Stores
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00134openalex-snapshot
Extendible RDMA-Based Remote Memory KV Store with Dynamic Perfect Hashing Index
inferred← citeshttps://doi.org/10.1109/tc.2024.3371793openalex-snapshot
On the Security of Quotient Filters: Attacks and Potential Countermeasures
inferred← citeshttps://doi.org/10.1109/tnet.2024.3403997openalex-snapshot
Bamboo Filters: Make Resizing Smooth and Adaptive
inferred← citeshttps://doi.org/10.1109/ton.2025.3565545openalex-snapshot
Bucket-Level Elastic Cuckoo Filter for Dynamic Set Membership Query and Encoded Set Operations
inferred← citeshttps://doi.org/10.1109/tpds.2024.3493953openalex-snapshot
Ripple: Enabling Decentralized Data Deduplication at the Edge
inferred← citeshttps://doi.org/10.1145/3626246.3654681openalex-snapshot
Beyond Bloom: A Tutorial on Future Feature-Rich Filters
inferred← citeshttps://doi.org/10.1145/3626758openalex-snapshot
A Learned Cuckoo Filter for Approximate Membership Queries over Variable-sized Sliding Windows on Data Streams
inferred← citeshttps://doi.org/10.1145/3639258openalex-snapshot
Grafite: Taming Adversarial Queries with Optimal Range Filters
inferred← citeshttps://doi.org/10.1145/3654944openalex-snapshot
GRF: A Global Range Filter for LSM-Trees with Shape Encoding
inferred← citeshttps://doi.org/10.1145/3663351openalex-snapshot
Proceedings of the 2nd Workshop on Simplicity in Management of Data
inferred← citeshttps://doi.org/10.1145/3663351.3663880openalex-snapshot
Wayfinder: Speeding up Key-Value Separation by Avoiding I/O Based Indirection
inferred← citeshttps://doi.org/10.1145/3698820openalex-snapshot
Memento Filter: A Fast, Dynamic, and Robust Range Filter
inferred← citeshttps://doi.org/10.1145/3725327openalex-snapshot
Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees
inferred← citeshttps://doi.org/10.1145/3786621openalex-snapshot
Aeris Filter: A Strongly and Monotonically Adaptive Range Filter
inferred← citeshttps://doi.org/10.1145/3786629openalex-snapshot
Breadcrumb Filters: Fast Fully Featured Filters
inferred← citeshttps://doi.org/10.1145/3802043openalex-snapshot
Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters
inferred← citeshttps://doi.org/10.1145/3802116openalex-snapshot
Sublime: Sublinear Error & Space for Unbounded Skewed Streams
inferred← citeshttps://doi.org/10.1145/3802128openalex-snapshot
Zeno Filter: To Infinity in Tiny Steps
inferred← citeshttps://doi.org/10.1145/3810900.3810910openalex-snapshot
Dynamic Range Filtering Beyond Worst-Case Bounds
inferred← citeshttps://doi.org/10.1177/15578666261493564openalex-snapshot
Super Bloom: Fast and Precise Filter for Streaming k -Mer Queries
inferred← citeshttps://doi.org/10.14778/3681954.3682020openalex-snapshot
Optimizing Collections of Bloom Filters within a Space Budget
inferred← citeshttps://doi.org/10.14778/3749646.3749664openalex-snapshot
Diva: Dynamic Range Filter for Var-Length Keys and Queries
inferred← citeshttps://doi.org/10.14778/3749646.3749703openalex-snapshot
Sphinx: A Succinct Perfect Hash Index for x86
inferred← citeshttps://doi.org/10.26599/tst.2024.9010160openalex-snapshot
Extensible Bloom Filters: Adaptive Strategies for Scalability and Efficiency in Network and Distributed Systems to Handle Increased Data
inferred← citeshttps://doi.org/10.3390/s23187775openalex-snapshot
PSBF: p-adic Integer Scalable Bloom Filter
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.