On the public citation graph
Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters
0 signed · 51 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.1002/ett.4460100604openalex-snapshot
Capacity of Multi‐antenna Gaussian Channels
inferredcites →https://doi.org/10.1007/11802839_49openalex-snapshot
Automatic Compilation Framework for Bloom Filter Based Intrusion Detection
inferredcites →https://doi.org/10.1007/11841036_42openalex-snapshot
Less Hashing, Same Performance: Building a Better Bloom Filter
inferredcites →https://doi.org/10.1049/el.2011.2798openalex-snapshot
Design of power-efficient parallel pipelined Bloom filter
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/icc.2007.259openalex-snapshot
Mesh Network Firewalling with Bloom Filters
inferredcites →https://doi.org/10.1109/infcom.2004.1354643openalex-snapshot
Approximate caches for packet classification
inferredcites →https://doi.org/10.1109/infcom.2005.1498343openalex-snapshot
Efficient and scalable query routing for unstructured peer-to-peer networks
inferredcites →https://doi.org/10.1109/infcom.2009.5061958openalex-snapshot
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
inferredcites →https://doi.org/10.1109/infcom.2009.5062180openalex-snapshot
IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards
inferredcites →https://doi.org/10.1109/infcom.2011.5934972openalex-snapshot
One memory access bloom filters and their generalization
inferredcites →https://doi.org/10.1109/infcom.2012.6195533openalex-snapshot
The Bloom paradox: When not to use a Bloom filter?
inferredcites →https://doi.org/10.1109/jsac.2006.877131openalex-snapshot
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
inferredcites →https://doi.org/10.1109/jsac.2006.884032openalex-snapshot
Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement
inferredcites →https://doi.org/10.1109/mm.2004.1268997openalex-snapshot
Deep packet inspection using parallel bloom filters
inferredcites →https://doi.org/10.1109/mm.2010.44openalex-snapshot
Tuple Pruning Using Bloom Filters for Packet Classification
inferredcites →https://doi.org/10.1109/tap.1966.1138693openalex-snapshot
Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
inferredcites →https://doi.org/10.1109/tc.2012.193openalex-snapshot
On Adding Bloom Filters to Longest Prefix Matching Algorithms
inferredcites →https://doi.org/10.1109/tnet.2006.872576openalex-snapshot
Longest prefix matching using bloom filters
inferredcites →https://doi.org/10.1145/1080091.1080114openalex-snapshot
Fast hash table lookup using extended bloom filter
inferredcites →https://doi.org/10.1145/1882486.1882534openalex-snapshot
Binary search on levels using a Bloom filter for IPv6 address lookup
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-031-98697-0_11openalex-snapshot
Empirical Comparison of Different Bloom Filter Variants
inferred← citeshttps://doi.org/10.1007/s00521-015-1989-6openalex-snapshot
A CMAC-based scheme for determining membership with classification of text strings
inferred← citeshttps://doi.org/10.1007/s00521-019-04397-1openalex-snapshot
Autoscaling Bloom filter: controlling trade-off between true and false positives
inferred← citeshttps://doi.org/10.1007/s13370-023-01042-yopenalex-snapshot
A note on maximal $$\hbox {B}_p$$-subalgebras of B-algebras
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.12.029openalex-snapshot
Dual-load Bloom filter: Application for name lookup
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.109802openalex-snapshot
ConPoolUBF: Connection pooling and updatable Bloom filter based SYN flood defense in programmable data planes
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.02.008openalex-snapshot
Name prefix matching using bloom filter pre-searching for content centric network
inferred← citeshttps://doi.org/10.1016/j.vehcom.2018.04.006openalex-snapshot
Adaptive trust and privacy management framework for vehicular networks
inferred← citeshttps://doi.org/10.1109/comst.2018.2889329openalex-snapshot
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
inferred← citeshttps://doi.org/10.1109/hpsr.2014.6900879openalex-snapshot
Binary search on trie levels with a bloom filter for longest prefix match
inferred← citeshttps://doi.org/10.1109/hpsr.2017.7968676openalex-snapshot
A new Bloom filter structure for identifying true positiveness of a Bloom filter
inferred← citeshttps://doi.org/10.1109/iarce64300.2024.00089openalex-snapshot
Modeling a Cross-Domain Distributed Personnel Records System Based on Zookeeper and Erasable Bloom Filters
inferred← citeshttps://doi.org/10.1109/iccmc.2019.8819818openalex-snapshot
Malicious Website Detection Using Probabilistic Data Structure Bloom Filter
inferred← citeshttps://doi.org/10.1109/icoin.2017.7899458openalex-snapshot
Bloom filter based data collection algorithm for wireless sensor networks
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2478462openalex-snapshot
Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2798668openalex-snapshot
Optimization of Multicast Source-Routing Based on Bloom Filter
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.2023.3263839openalex-snapshot
Ark Filter: A General and Space-Efficient Sketch for Network Flow Analysis
inferred← citeshttps://doi.org/10.1109/tnsm.2021.3059075openalex-snapshot
Bloom Filter With a False Positive Free Zone
inferred← citeshttps://doi.org/10.1109/tpds.2016.2577033openalex-snapshot
A Fast and Accurate Hardware String Matching Module with Bloom Filters
inferred← citeshttps://doi.org/10.1109/tpds.2021.3108899openalex-snapshot
DH-SVRF: A Reconfigurable Unicast/Multicast Forwarding for High-Performance Packet Forwarding Engines
inferred← citeshttps://doi.org/10.1177/1550147717749744openalex-snapshot
Bloom filter–based efficient broadcast algorithm for the Internet of things
inferred← citeshttps://doi.org/10.32657/10356/69407openalex-snapshot
Towards security and privacy for emerging wireless networks
inferred← citeshttps://doi.org/10.3390/app13137830openalex-snapshot
CRBF: Cross-Referencing Bloom-Filter-Based Data Integrity Verification Framework for Object-Based Big Data Transfer Systems
inferred← citeshttps://doi.org/10.3929/ethz-b-000411747openalex-snapshot
Autoscaling Bloom filter: controlling trade-off between true and false positives
inferred← citeshttps://doi.org/10.5755/j01.itc.49.2.24633openalex-snapshot
Multiclass Membership Determination Integrating an ID-Bound Method with 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.