On the public citation graph

Capacity and Robustness Tradeoffs in Bloom Filters for Distributed Applications

0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/j.comnet.2010.12.025openalex-snapshot
A Generalized Bloom Filter to Secure Distributed Network Applications
inferredcites →https://doi.org/10.1016/j.ipl.2010.07.024openalex-snapshot
A new analysis of the false positive rate of a Bloom filter
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/90.929847openalex-snapshot
Network support for IP traceback
inferredcites →https://doi.org/10.1109/icc.2010.5501745openalex-snapshot
A Lifetime-Based Peer Selection Mechanism for Peer-to-Peer Video-on-Demand Systems
inferredcites →https://doi.org/10.1109/infcom.2011.5934972openalex-snapshot
One memory access bloom filters and their generalization
inferredcites →https://doi.org/10.1109/infocom.2007.161openalex-snapshot
Incremental Bloom Filters
inferredcites →https://doi.org/10.1109/infocom.2008.161openalex-snapshot
Incremental Bloom Filters
inferredcites →https://doi.org/10.1109/iscc.2002.1021797openalex-snapshot
Internet topology modeler based on map sampling
inferredcites →https://doi.org/10.1109/lcn.2007.15openalex-snapshot
Towards Stateless Single-Packet IP Traceback
inferredcites →https://doi.org/10.1109/lcn.2007.160openalex-snapshot
Co-operative handover in 3G System Architecture Evolution
inferredcites →https://doi.org/10.1109/surv.2011.031611.00024openalex-snapshot
Theory and Practice of Bloom Filters for Distributed Systems
inferredcites →https://doi.org/10.1109/tkde.2009.57openalex-snapshot
The Dynamic Bloom Filters
inferredcites →https://doi.org/10.1109/tpds.2006.179openalex-snapshot
Twins: A Dual Addressing Space Representation for Self-Organizing Networks
inferredcites →https://doi.org/10.1109/tpds.2008.132openalex-snapshot
Flexible Deterministic Packet Marking: An IP Traceback System to Find the Real Source of Attacks
inferredcites →https://doi.org/10.1109/tpds.2009.39openalex-snapshot
Using Parallel Bloom Filters for Multiattribute Representation on Network Services
inferredcites →https://doi.org/10.1109/tpds.2010.116openalex-snapshot
Supporting Scalable and Adaptive Metadata Management in Ultralarge-Scale File Systems
inferredcites →https://doi.org/10.1145/1111322.1111328openalex-snapshot
The internet AS-level topology
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/1368436.1368454openalex-snapshot
Retouched bloom filters

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118579848.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-981-97-5552-3_19openalex-snapshot
CPCF: A Flexible Chunking and Proactive Insertion Cuckoo Filter
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.csi.2014.05.002openalex-snapshot
Node discovery scheme of DDS for combat management system
inferred← citeshttps://doi.org/10.1109/ccgrid51090.2021.00089openalex-snapshot
Software Defined Ambit of Data Integrity for the Internet of Things
inferred← citeshttps://doi.org/10.1109/comst.2018.2889329openalex-snapshot
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
inferred← citeshttps://doi.org/10.1109/etfa.2013.6648047openalex-snapshot
Discovery protocol for data distribution service in naval warships using extended counting bloom filters
inferred← citeshttps://doi.org/10.1109/iwqos.2015.7404747openalex-snapshot
Identifying frequent flows in large datasets through probabilistic bloom filters
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/tnet.2012.2227977openalex-snapshot
An Efficient and Robust Addressing Protocol for Node Autoconfiguration in Ad Hoc Networks
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/tpds.2013.46openalex-snapshot
Fast Bloom Filters and Their Generalization
inferred← citeshttps://doi.org/10.1109/tpds.2023.3303924openalex-snapshot
SketchINT: Empowering INT With TowerSketch for Per-Flow Per-Switch Measurement
inferred← citeshttps://doi.org/10.3390/app10196692openalex-snapshot
A Novel Hardware Security Architecture for IoT Device: PD-CRP (PUF Database and Challenge–Response Pair) Bloom Filter on Memristor-Based PUF
inferred← citeshttps://doi.org/10.48550/arxiv.1912.07153openalex-snapshot
Matrix Bloom Filter: An Efficient Probabilistic Data Structure for 2-tuple Batch Lookup
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.