On the public citation graph
Faster searching in tries and quadtrees—An analysis of level compression
0 signed · 37 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/spe.4380250203openalex-snapshot
Efficient implementation of suffix trees
inferredcites →https://doi.org/10.1007/3-540-16761-7_67openalex-snapshot
Some further results on digital search trees
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf00533604openalex-snapshot
Entropy and maximal spacings for random partitions
inferredcites →https://doi.org/10.1007/bf02279819openalex-snapshot
A note on the average depth of tries
inferredcites →https://doi.org/10.1016/0020-0190(90)90214-iopenalex-snapshot
A guided tour of chernoff bounds
inferredcites →https://doi.org/10.1016/0020-0190(93)90068-kopenalex-snapshot
Improved behaviour of tries by adaptive branching
inferredcites →https://doi.org/10.1016/0196-6774(92)90003-uopenalex-snapshot
Efficient pattern matching with scaling
inferredcites →https://doi.org/10.1016/s0304-0208(08)73107-4openalex-snapshot
Algebraic Methods for Trie Statistics
inferredcites →https://doi.org/10.1017/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
inferredcites →https://doi.org/10.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1214/aop/1176993000openalex-snapshot
Asymptotical Growth of a Class of Random Trees
inferredcites →https://doi.org/10.5555/314464.314678openalex-snapshot
Let sleeping files lie: pattern matching in Z-compressed files
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20067openalex-snapshot
Probabilistic behavior of asymmetric level compressed tries
inferred← citeshttps://doi.org/10.1007/11534273_7openalex-snapshot
Analysis of a Class of Tries with Adaptive Multi-digit Branching
inferred← citeshttps://doi.org/10.1007/978-0-387-35378-4_2openalex-snapshot
Fast address lookup for Internet routers
inferred← citeshttps://doi.org/10.1007/s00453-001-0102-yopenalex-snapshot
An Experimental Study of Compression Methods for Dynamic Tries
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.06.008openalex-snapshot
On the average depth of asymmetric LC-tries
inferred← citeshttps://doi.org/10.1023/a:1023837529522openalex-snapshot
On Time-Space Efficiency of Digital Trees with Adaptive Multidigit Branching
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709677openalex-snapshot
Performance evaluation and cache behavior of LC-trie for IP-address lookup
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281239openalex-snapshot
TRASH A dynamic LC-trie and hash data structure
inferred← citeshttps://doi.org/10.1109/icnp.2014.55openalex-snapshot
Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously
inferred← citeshttps://doi.org/10.1137/s0097539799359361openalex-snapshot
Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods
inferred← citeshttps://doi.org/10.1145/1064546.1064548openalex-snapshot
Adaptive data structures for IP lookups
inferred← citeshttps://doi.org/10.1145/502912.502914openalex-snapshot
Scalable high-speed prefix matching
inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot
Tries in data retrieval and syntactic pattern recognition
inferred← citeshttps://doi.org/10.4304/jnw.2.3.18-27openalex-snapshot
Improving and Analyzing LC-Trie Performance for IP-Address 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.