On the public citation graph
A dynamic lookup scheme for bursty access patterns
0 signed · 44 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/978-0-387-35378-4_2openalex-snapshot
Fast address lookup for Internet routers
inferredcites →https://doi.org/10.1109/49.464717openalex-snapshot
A parameterizable methodology for Internet traffic flow profiling
inferredcites →https://doi.org/10.1109/infcom.1998.662938openalex-snapshot
Routing lookups in hardware at memory access speeds
inferredcites →https://doi.org/10.1109/infcom.1998.662939openalex-snapshot
IP lookups using multiway and multicolumn search
inferredcites →https://doi.org/10.1109/infcom.1999.752164openalex-snapshot
Optimal routing table design for IP address lookups under memory constraints
inferredcites →https://doi.org/10.1109/infcom.2000.832490openalex-snapshot
Near-optimal routing lookups with bounded worst case performance
inferredcites →https://doi.org/10.1137/s0097539792231167openalex-snapshot
A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
inferredcites →https://doi.org/10.1145/263105.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferredcites →https://doi.org/10.1145/263105.263135openalex-snapshot
A simulation study of IP switching
inferredcites →https://doi.org/10.1145/263109.263135openalex-snapshot
A simulation study of IP switching
inferredcites →https://doi.org/10.1145/277851.277863openalex-snapshot
Faster IP lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/78973.78977openalex-snapshot
Skip lists: a probabilistic alternative to balanced trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_2openalex-snapshot
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
inferred← citeshttps://doi.org/10.1007/978-0-387-77745-0_29openalex-snapshot
Semantic technologies for mobile Web and personalized ranking of mobile Web search results
inferred← citeshttps://doi.org/10.1007/978-0-387-89828-5_15openalex-snapshot
Concepts for Self-Protection
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_68openalex-snapshot
Efficient IP Table Lookup via Adaptive Stratified Trees with Selective Reconstructions
inferred← citeshttps://doi.org/10.1007/978-3-540-88181-0_27openalex-snapshot
Dynamic Scheme for Packet Classification Using Splay Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-15381-5_16openalex-snapshot
Simplified Self-Adapting Skip Lists
inferred← citeshttps://doi.org/10.1016/j.jss.2010.06.026openalex-snapshot
A web personalizing technique using adaptive data structures: The case of bursts in web visits
inferred← citeshttps://doi.org/10.1109/cmsp.2011.117openalex-snapshot
BSLstream: A Biased Skip List index Scheme for P2P VoD with VCR Support
inferred← citeshttps://doi.org/10.1109/glocom.2004.1378250openalex-snapshot
Prefix- and interval-partitioned router-tables
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss.2016.0035openalex-snapshot
Predicting the Bursts of Data Access Streams by Filtering Correlated I/Os
inferred← citeshttps://doi.org/10.1109/iccnmc.2003.1243038openalex-snapshot
A fast two-way IP lookup algorithm based multibit-trie
inferred← citeshttps://doi.org/10.1109/icn.2007.38openalex-snapshot
Dynamic Tree Bitmap for IP Lookup and Update
inferred← citeshttps://doi.org/10.1109/icsc.2010.49openalex-snapshot
A Semantic Web Personalizing Technique: The Case of Bursts in Web Visits
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358645openalex-snapshot
A B-tree dynamic router-table design
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358648openalex-snapshot
Dynamic IP router-tables using highest-priority matching
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004254openalex-snapshot
Data structures for one-dimensional packet classification using most-specific-rule matching
inferred← citeshttps://doi.org/10.1109/mm.2005.72openalex-snapshot
Power-Efficient TCAMS for Bursty Access Patterns
inferred← citeshttps://doi.org/10.1109/tc.2004.116openalex-snapshot
Enhanced interval trees for dynamic IP router-tables
inferred← citeshttps://doi.org/10.1109/tc.2004.1261840openalex-snapshot
An O(log n) dynamic router-table design
inferred← citeshttps://doi.org/10.1109/tc.2004.81openalex-snapshot
O(log n) dynamic router-tables for prefixes and ranges
inferred← citeshttps://doi.org/10.1109/tc.2005.104openalex-snapshot
A B-tree dynamic router-table design
inferred← citeshttps://doi.org/10.1109/tc.2005.83openalex-snapshot
Prefix and Interval-Partitioned Dynamic IP Router-Tables
inferred← citeshttps://doi.org/10.1142/s0129054103001777openalex-snapshot
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
inferred← citeshttps://doi.org/10.1142/s0129054104002625openalex-snapshot
EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS
inferred← citeshttps://doi.org/10.1145/1227161.1278376openalex-snapshot
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
inferred← citeshttps://doi.org/10.1145/380752.380843openalex-snapshot
Biased dictionaries with fast insert/deletes
inferred← citeshttps://doi.org/10.1145/996546.996550openalex-snapshot
Fast prefix matching of bounded strings
inferred← citeshttps://doi.org/10.1201/9780849380587.ch6openalex-snapshot
Efficient Data Structures for Bursty Access Patterns
inferred← citeshttps://doi.org/10.3233/hsn-2005-263openalex-snapshot
A lookup algorithm based on multiple tables for high-speed routers
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.