On the public citation graph
Set Reconciliation via Counting Bloom Filters
0 signed · 66 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_42openalex-snapshot
Less Hashing, Same Performance: Building a Better Bloom Filter
inferredcites →https://doi.org/10.1007/s00778-009-0140-7openalex-snapshot
Statistical structures for Internet-scale data management
inferredcites →https://doi.org/10.1007/s10619-010-7067-2openalex-snapshot
Cardinality estimation and dynamic length adaptation for Bloom filters
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1016/j.pedn.2004.05.006openalex-snapshot
Childhood obesity and insulin-resistant syndrome
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/icde.2006.44openalex-snapshot
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
inferredcites →https://doi.org/10.1109/infcom.2009.5062028openalex-snapshot
NetTube: Exploring Social Networks for Peer-to-Peer Short Video Sharing
inferredcites →https://doi.org/10.1109/infocom.2008.108openalex-snapshot
Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection
inferredcites →https://doi.org/10.1109/ipsn.2008.17openalex-snapshot
Data Discovery and Dissemination with DIP
inferredcites →https://doi.org/10.1109/jsac.2012.121023openalex-snapshot
A Generalized Probabilistic Topology Control for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/mdm.2010.19openalex-snapshot
Dessy: Demonstrating Mobile Search and Synchronization
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.209openalex-snapshot
False Negative Problem of Counting Bloom Filter
inferredcites →https://doi.org/10.1109/tmc.2010.240openalex-snapshot
A Lightweight and Density-Aware Reprogramming Protocol for Wireless Sensor Networks
inferredcites →https://doi.org/10.1109/tnet.2004.836103openalex-snapshot
Informed Content Delivery Across Adaptive Overlay Networks
inferredcites →https://doi.org/10.1109/tnet.2005.860096openalex-snapshot
What's new: finding significant differences in network data streams
inferredcites →https://doi.org/10.1109/tnet.2007.896150openalex-snapshot
Reversible Sketches: Enabling Monitoring and Analysis Over High-Speed Data Streams
inferredcites →https://doi.org/10.1109/tpds.2008.24openalex-snapshot
A Two-Hop Solution to Solving Topology Mismatch
inferredcites →https://doi.org/10.1145/1993636.1993639openalex-snapshot
Tight bounds for parallel randomized load balancing
inferredcites →https://doi.org/10.1145/509907.509965openalex-snapshot
Similarity estimation techniques from rounding algorithms
inferredcites →https://doi.org/10.1145/509961.509965openalex-snapshot
Similarity estimation techniques from rounding algorithms
inferredcites →https://doi.org/10.5555/338219.338246openalex-snapshot
Min-Wise versus linear independence (extended abstract)
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-59016-1_20openalex-snapshot
Multiset Synchronization with Counting Cuckoo Filters
inferred← citeshttps://doi.org/10.1007/978-3-319-18123-3_21openalex-snapshot
Improved Weighted Bloom Filter and Space Lower Bound Analysis of Algorithms for Approximated Membership Querying
inferred← citeshttps://doi.org/10.1007/s11704-019-8437-1openalex-snapshot
Guaranteeing the response deadline for general aggregation trees
inferred← citeshttps://doi.org/10.1007/s11704-022-1685-5openalex-snapshot
Gauze: enabling communication-friendly block synchronization with cuckoo filter
inferred← citeshttps://doi.org/10.1016/j.comcom.2013.03.007openalex-snapshot
Efficient false positive free set synchronization using an extended bloom filter approach
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.06.014openalex-snapshot
Information reconciliation schemes in physical-layer security: A survey
inferred← citeshttps://doi.org/10.1016/j.peva.2025.102520openalex-snapshot
CommonSense: Efficient Set Intersection (SetX) protocol based on compressed sensing
inferred← citeshttps://doi.org/10.1109/allerton.2017.8262865openalex-snapshot
Reconciling similar sets
inferred← citeshttps://doi.org/10.1109/comsnets51098.2021.9352944openalex-snapshot
Sketches for Blockchains
inferred← citeshttps://doi.org/10.1109/comst.2018.2889329openalex-snapshot
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
inferred← citeshttps://doi.org/10.1109/iccnc.2017.7876279openalex-snapshot
Set reconciliation with an inaccurate oracle
inferred← citeshttps://doi.org/10.1109/icde.2019.00271openalex-snapshot
Near-Accurate Multiset Reconciliation (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00110openalex-snapshot
A Compact and Accurate Sketch for Estimating a Large Range of Set Difference Cardinalities
inferred← citeshttps://doi.org/10.1109/iceic69189.2026.11386281openalex-snapshot
Revolving-Bloom Filter: A Bloom Filter Variant for Effective Set Reconciliation
inferred← citeshttps://doi.org/10.1109/isit.2015.7282974openalex-snapshot
Reconciling similar sets of data
inferred← citeshttps://doi.org/10.1109/jiot.2018.2875915openalex-snapshot
Fog-Based Computing and Storage Offloading for Data Synchronization in IoT
inferred← citeshttps://doi.org/10.1109/srds60354.2023.00016openalex-snapshot
Range-Based Set Reconciliation
inferred← citeshttps://doi.org/10.1109/tce.2014.7027337openalex-snapshot
Page replacement algorithm based on counting bloom filter for NAND flash memory
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2910578openalex-snapshot
Reconciling Similar Sets of Data
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3296630openalex-snapshot
A Rate-Compatible Solution to the Set Reconciliation Problem
inferred← citeshttps://doi.org/10.1109/tkde.2018.2849997openalex-snapshot
Near-accurate Multiset Reconciliation
inferred← citeshttps://doi.org/10.1109/tkde.2023.3237009openalex-snapshot
Set Reconciliation Using Ternary and Invertible Bloom Filters
inferred← citeshttps://doi.org/10.1109/tnet.2016.2618006openalex-snapshot
Efficient Multiset Synchronization
inferred← citeshttps://doi.org/10.1109/tnet.2019.2944954openalex-snapshot
The Tandem Counting Bloom Filter - It Takes Two Counters to Tango
inferred← citeshttps://doi.org/10.1109/tnsm.2022.3164369openalex-snapshot
GenSync: A New Framework for Benchmarking and Optimizing Reconciliation of Data
inferred← citeshttps://doi.org/10.1109/tnsm.2024.3372604openalex-snapshot
SoK: Applications of Sketches and Rollups in Blockchain Networks
inferred← citeshttps://doi.org/10.1109/tpds.2021.3074440openalex-snapshot
MCFsyn: A Multi-Party Set Reconciliation Protocol With the Marked Cuckoo Filter
inferred← citeshttps://doi.org/10.1109/tst.2016.7442499openalex-snapshot
Comparing set reconciliation methods based on bloom filters and their variants
inferred← citeshttps://doi.org/10.1145/3357384.3358065openalex-snapshot
Set Reconciliation with Cuckoo Filters
inferred← citeshttps://doi.org/10.14778/3436905.3436906openalex-snapshot
Space- and computationally-efficient set reconciliation via parity bitmap sketch (PBS)
inferred← citeshttps://doi.org/10.21236/ada624896openalex-snapshot
A Survey of Algorithms to Efficiently Reconcile Sets of Infomation
inferred← citeshttps://doi.org/10.21655/ijsi.1673-7288.00296openalex-snapshot
Jump Filter: A Dynamic Sketch for Big Data Governance
inferred← citeshttps://doi.org/10.23940/ijpe.19.07.p22.19471954openalex-snapshot
Efficiently Retrieving Differences Between Remote Sets using Counting Bloom Filter
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07782openalex-snapshot
The Distributed Bloom Filter
inferred← citeshttps://doi.org/10.48550/arxiv.1912.07153openalex-snapshot
Matrix Bloom Filter: An Efficient Probabilistic Data Structure for 2-tuple Batch Lookup
inferred← citeshttps://doi.org/10.56714/bjrs.50.1.23openalex-snapshot
Adoption of Bloom Filter and Firebase Framework to Enhance Authentication Time for Healthcare Systems Based on Blockchain Technology
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.