On the public citation graph
Order preserving extendible hashing and bucket tries
0 signed · 49 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-3-642-96552-4openalex-snapshot
Content-Addressable Memories
inferredcites →https://doi.org/10.1007/978-94-011-7801-3openalex-snapshot
The Statistical Analysis of Series of Events
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1016/0020-0190(75)90034-4openalex-snapshot
Analysis of range searches in quad trees
inferredcites →https://doi.org/10.1016/0020-0190(80)90008-3openalex-snapshot
A note on the analysis of extendible hashing
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1080/03155986.1978.11731685openalex-snapshot
Key-To-Address Transformation Techniques
inferredcites →https://doi.org/10.1093/comjnl/22.3.220openalex-snapshot
Priority queue administration by sublist index
inferredcites →https://doi.org/10.1145/1734714.1734729openalex-snapshot
Expandable open addressing hash table storage and retrieval
inferredcites →https://doi.org/10.1145/319540.319564openalex-snapshot
New file organization based on dynamic hashing
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/321105.321108openalex-snapshot
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
inferredcites →https://doi.org/10.1145/322169.322177openalex-snapshot
External Hashing Schemes for Collections of Data Structures
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1145/356631.356633openalex-snapshot
Identifier Search Mechanisms: A Survey and Generalized Model
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/362686.362693openalex-snapshot
File structures using hashing functions
inferredcites →https://doi.org/10.1287/opre.27.1.161openalex-snapshot
Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
inferredcites →https://doi.org/10.2172/1447024openalex-snapshot
A Survey of Algorithms and Data Structures for Range Searching
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.2307/2986878openalex-snapshot
The Statistical Analysis of Series of Events.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199702)28:2<86::aid-scj9>3.0.co;2-nopenalex-snapshot
Improvement of binary digital search trees using hierarchical structures
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_5openalex-snapshot
Hash-Based File Organization Utilizing Large Capacity Main Memory
inferred← citeshttps://doi.org/10.1007/978-1-4615-1379-7_21openalex-snapshot
HQT*: A Scalable Distributed Data Structure for High-Performance Spatial Accesses
inferred← citeshttps://doi.org/10.1007/978-3-540-39737-3_28openalex-snapshot
A Robust Scheme for Multilevel Extendible Hashing
inferred← citeshttps://doi.org/10.1007/bf01934393openalex-snapshot
The extendible cell method for closest point problems
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90123-5openalex-snapshot
Extendible hashing with overflow
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90123-6openalex-snapshot
On the use of Extendible Hashing without hashing
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90024-0openalex-snapshot
Two levels are as good as any
inferred← citeshttps://doi.org/10.1016/0734-189x(83)90041-5openalex-snapshot
Performance analysis of cell based geometric file organizations
inferred← citeshttps://doi.org/10.1080/00207169708804560openalex-snapshot
An order searching algorithm of extensible hashing
inferred← citeshttps://doi.org/10.1109/adc.2000.819814openalex-snapshot
Ω-storage: a self organizing multi-attribute storage technique for very large main memories
inferred← citeshttps://doi.org/10.1109/icde.1986.7266204openalex-snapshot
The bounded disorder access method
inferred← citeshttps://doi.org/10.1109/icde.1988.105506openalex-snapshot
Linearizing the directory growth in order preserving extendible hashing
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1982.tb00032.xopenalex-snapshot
Hidden Lines using the EXCELL Method
inferred← citeshttps://doi.org/10.1137/0219057openalex-snapshot
An Analysis of Random d -Dimensional Quad Trees
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/582353.582389openalex-snapshot
Efficient spatial access to a data base
inferred← citeshttps://doi.org/10.1145/588011.588037openalex-snapshot
A class of data structures for associative searching
inferred← citeshttps://doi.org/10.5555/800263.809228openalex-snapshot
The EXCELL Method for Efficient Geometric Access to Data
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.