On the public citation graph
Automatic Compilation Framework for Bloom Filter Based Intrusion Detection
0 signed · 29 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/3-540-46117-5_43openalex-snapshot
Granidt: Towards Gigabit Rate Network Intrusion Detection Technology
inferredcites →https://doi.org/10.1007/3-540-46117-5_48openalex-snapshot
Specialized Hardware for Deep Network Packet Filtering
inferredcites →https://doi.org/10.1007/978-3-540-45234-8_85openalex-snapshot
Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System
inferredcites →https://doi.org/10.1109/fccm.2004.41openalex-snapshot
Implementation Results of Bloom Filters for String Matching
inferredcites →https://doi.org/10.1109/fccm.2004.50openalex-snapshot
Scalable Pattern Matching for High Speed Networks
inferredcites →https://doi.org/10.1109/fpga.2002.1106678openalex-snapshot
Fast area estimation to support compiler optimizations in FPGA-based reconfigurable systems
inferredcites →https://doi.org/10.1109/fpga.2003.1227239openalex-snapshot
Implementation of a content-scanning module for an Internet firewall
inferredcites →https://doi.org/10.1109/fpl.2005.1515696openalex-snapshot
Hashing + memory = lowcost, exact pattern matching
inferredcites →https://doi.org/10.1145/1095890.1095918openalex-snapshot
High-throughput linked-pattern matching for intrusion detection systems
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-642-31020-1_65openalex-snapshot
Optimizing Hash Function Number for BF-Based Object Locating Algorithm
inferred← citeshttps://doi.org/10.1007/s00450-010-0106-4openalex-snapshot
DotStar: breaking the scalability and performance barriers in parsing regular expressions
inferred← citeshttps://doi.org/10.1007/s10766-010-0147-0openalex-snapshot
Top-Performance Tokenization and Small-Ruleset Regular Expression Matching
inferred← citeshttps://doi.org/10.1016/j.procs.2019.11.291openalex-snapshot
Application of Data Distribution Technology in Smart Cities
inferred← citeshttps://doi.org/10.1109/ares.2015.101openalex-snapshot
A Performance Evaluation of Hash Functions for IP Reputation Lookup Using Bloom Filters
inferred← citeshttps://doi.org/10.1109/compcomm.2018.8780794openalex-snapshot
Memory-Compact Membership Lookup for Multiple Data Sets by a Single Bloom Filter
inferred← citeshttps://doi.org/10.1109/drcn.2009.5339986openalex-snapshot
Two-stage decomposition of SNORT rules towards efficient hardware implementation
inferred← citeshttps://doi.org/10.1109/hpca.2012.6169044openalex-snapshot
Accelerating business analytics applications
inferred← citeshttps://doi.org/10.1109/icacte.2010.5578947openalex-snapshot
A multi-layer bloom filter for duplicated URL detection
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934972openalex-snapshot
One memory access bloom filters and their generalization
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536300openalex-snapshot
High-speed string searching against large dictionaries on the Cell/B.E. Processor
inferred← citeshttps://doi.org/10.1109/mc.2008.105openalex-snapshot
Accelerating Real-Time String Searching with Multicore Processors
inferred← citeshttps://doi.org/10.1109/surv.2011.072210.00075openalex-snapshot
A Survey on the Application of FPGAs for Network Infrastructure Security
inferred← citeshttps://doi.org/10.1109/tpds.2013.46openalex-snapshot
Fast Bloom Filters and Their Generalization
inferred← citeshttps://doi.org/10.1145/1323548.1323571openalex-snapshot
Compiling PCRE to FPGA for accelerating SNORT IDS
inferred← citeshttps://doi.org/10.1145/1366230.1366237openalex-snapshot
Exact multi-pattern string matching on the cell/b.e. processor
inferred← citeshttps://doi.org/10.1145/1542275.1542284openalex-snapshot
High-performance regular expression scanning on the Cell/B.E. processor
inferred← citeshttps://doi.org/10.12785/amis/080445openalex-snapshot
Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters
inferred← citeshttps://doi.org/10.1587/transinf.2016inp0022openalex-snapshot
Multi-Dimensional Bloom Filter: Design and Evaluation
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.