On the public citation graph
Aging Bloom Filter with Two Active Buffers for Dynamic Sets
0 signed · 60 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.1016/0010-4485(77)90049-5openalex-snapshot
Fundamentals of data-structures
inferredcites →https://doi.org/10.1080/15427951.2004.10129096openalex-snapshot
Network Applications of Bloom Filters: A Survey
inferredcites →https://doi.org/10.1109/90.851975openalex-snapshot
Summary cache: a scalable wide-area Web cache sharing protocol
inferredcites →https://doi.org/10.1109/infcom.2004.1354587openalex-snapshot
Space-code bloom filter for efficient per-flow traffic measurement
inferredcites →https://doi.org/10.1109/infcom.2004.1354643openalex-snapshot
Approximate caches for packet classification
inferredcites →https://doi.org/10.1109/infcom.2005.1498554openalex-snapshot
Compact neighbor discovery (a bandwidth defense through bandwidth optimization)
inferredcites →https://doi.org/10.1109/infocom.2006.325openalex-snapshot
Theory and Network Applications of Dynamic Bloom Filters
inferredcites →https://doi.org/10.1109/jsac.2006.877139openalex-snapshot
Detection of Super Sources and Destinations in High-Speed Networks: Algorithms, Analysis and Evaluation
inferredcites →https://doi.org/10.1109/rtss.2005.24openalex-snapshot
Gradient-Ascending Routing via Footprints in Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tnet.2002.801399openalex-snapshot
The BLUE active queue management algorithms
inferredcites →https://doi.org/10.1145/1142473.1142477openalex-snapshot
Approximately detecting duplicates for streaming data using stable bloom filters
inferredcites →https://doi.org/10.1145/1254882.1254916openalex-snapshot
Building high accuracy bloom filters using partitioned hashing
inferredcites →https://doi.org/10.1145/1269899.1254916openalex-snapshot
Building high accuracy bloom filters using partitioned hashing
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-15032-7_96openalex-snapshot
Hot Spot Tracking by Time-Decaying Bloom Filters and Reservoir Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_6openalex-snapshot
Approaching Optimal Duplicate Detection in a Sliding Window
inferred← citeshttps://doi.org/10.1007/978-3-319-42553-5_8openalex-snapshot
A Compact In-memory Index for Managing Set Membership Queries on Streaming Data
inferred← citeshttps://doi.org/10.1007/978-3-642-30823-9_1openalex-snapshot
Slead: Low-Memory, Steady Distributed Systems Slicing
inferred← citeshttps://doi.org/10.1007/s00453-015-0007-9openalex-snapshot
Tight Bounds for Sliding Bloom Filters
inferred← citeshttps://doi.org/10.1007/s00778-019-00561-0openalex-snapshot
Morton filters: fast, compressed sparse cuckoo filters
inferred← citeshttps://doi.org/10.1007/s11277-015-2662-1openalex-snapshot
Security Enhancement in Distributed Networks Using Link-Based Mapping Scheme for Network Intrusion Detection with Enhanced Bloom Filter
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.12.025openalex-snapshot
A Generalized Bloom Filter to Secure Distributed Network Applications
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.11.002openalex-snapshot
Improving counting Bloom filter performance with fingerprints
inferred← citeshttps://doi.org/10.1109/cins63881.2024.10864463openalex-snapshot
Augmented Array based Efficient Fill Ratio Estimation in a Bloom Filter
inferred← citeshttps://doi.org/10.1109/cloud-summit61220.2024.00032openalex-snapshot
Poster: A Fast Monitor for Slow Network Attacks
inferred← citeshttps://doi.org/10.1109/comsnets.2013.6465564openalex-snapshot
Importance-aware Bloom Filter for managing set membership queries on streaming data
inferred← citeshttps://doi.org/10.1109/comst.2018.2889329openalex-snapshot
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254723openalex-snapshot
HCaching: High-Speed Caching for Information-Centric Networking
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys53884.2021.00082openalex-snapshot
HSS: Faster and More Accurate Sliding Sketch by Using Half Fields
inferred← citeshttps://doi.org/10.1109/icc.2011.5962722openalex-snapshot
Hinky: Defending against Text-Based Message Spam on Smartphones
inferred← citeshttps://doi.org/10.1109/icde.2013.6544902openalex-snapshot
TBF: A memory-efficient replacement policy for flash-based caches
inferred← citeshttps://doi.org/10.1109/icnp61940.2024.10858535openalex-snapshot
Envisioning a Unified Programmable Dataplane to Monitor Slow Attacks
inferred← citeshttps://doi.org/10.1109/infcomw.2017.8116536openalex-snapshot
Poster abstract: A sliding counting bloom filter
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485882openalex-snapshot
Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free
inferred← citeshttps://doi.org/10.1109/ladc.2013.21openalex-snapshot
Slicing as a Distributed Systems Primitive
inferred← citeshttps://doi.org/10.1109/surv.2011.031611.00024openalex-snapshot
Theory and Practice of Bloom Filters for Distributed Systems
inferred← citeshttps://doi.org/10.1109/tc.2020.3036424openalex-snapshot
FadingBF: A Bloom Filter With Consistent Guarantees for Online Applications
inferred← citeshttps://doi.org/10.1109/tkde.2022.3151140openalex-snapshot
A Sketch Framework for Approximate Data Stream Processing in Sliding Windows
inferred← citeshttps://doi.org/10.1109/tkde.2022.3200045openalex-snapshot
On the Evolutionary of Bloom Filter False Positives - An Information Theoretical Approach to Optimizing Bloom Filter Parameters
inferred← citeshttps://doi.org/10.1109/tnet.2018.2813425openalex-snapshot
Dynamically Updatable Ternary Segmented Aging Bloom Filter for OpenFlow-Compliant Low-Power Packet Processing
inferred← citeshttps://doi.org/10.1109/tnsm.2024.3460751openalex-snapshot
HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows
inferred← citeshttps://doi.org/10.1109/ton.2025.3646730openalex-snapshot
Enabling General and Efficient Window Mechanism for In-Network Telemetry
inferred← citeshttps://doi.org/10.1145/2540708.2540717openalex-snapshot
A locality-aware memory hierarchy for energy-efficient GPU architectures
inferred← citeshttps://doi.org/10.1145/3394486.3403144openalex-snapshot
Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding Windows
inferred← citeshttps://doi.org/10.1145/3448016.3452829openalex-snapshot
Building Fast and Compact Sketches for Approximately Multi-Set Multi-Membership Querying
inferred← citeshttps://doi.org/10.1145/3603269.3604847openalex-snapshot
OmniWindow: A General and Efficient Window Mechanism Framework for Network Telemetry
inferred← citeshttps://doi.org/10.1587/transcom.e97.b.765openalex-snapshot
Asymmetric Sparse Bloom Filter
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.26599/tst.2024.9010187openalex-snapshot
A Block-Wise Updating Strategy for Approximate Duplicate Detection
inferred← citeshttps://doi.org/10.3390/network5020010openalex-snapshot
A Survey of Quality-of-Service and Quality-of-Experience Provisioning in Information-Centric Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2001.03147openalex-snapshot
Age-Partitioned Bloom Filters
inferred← citeshttps://doi.org/10.70675/34ac95cbz6413z46ddz9d2az3cb8a1a7497dopenalex-snapshot
On information-centric routing and forwarding in the internet of things
inferred← citeshttps://doi.org/10.70675/9d40429czb0d5z432dz9ff2z1a0d1a64bd4aopenalex-snapshot
Security of cryptographic protocols and data structures : design and optimisation
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.