On the public citation graph
On the performance evaluation of extendible hashing and trie searching
0 signed · 119 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/bfb0012773openalex-snapshot
A branching process arising in dynamic hashing, trie searching and polynomial factorization
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/0020-0190(81)90033-8openalex-snapshot
On the average height of trees in digital search and dynamic hashing
inferredcites →https://doi.org/10.1016/s0021-9800(67)80075-9openalex-snapshot
Extensions of the birthday surprise
inferredcites →https://doi.org/10.1016/s0021-9800(69)80019-0openalex-snapshot
More birthday surprises
inferredcites →https://doi.org/10.1063/1.3060724openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot
Expected Length of the Longest Probe Sequence in Hash Code Searching
inferredcites →https://doi.org/10.2307/2002374openalex-snapshot
An Introduction to Combinatorial Analysis
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471224634.ch14openalex-snapshot
Multidimensional Indexing Structures for Content‐Based Retrieval
inferred← citeshttps://doi.org/10.1002/rsa.10015openalex-snapshot
Size and path length of Patricia tries: Dynamical sources context
inferred← citeshttps://doi.org/10.1002/rsa.20023openalex-snapshot
On the number of full levels in tries
inferred← citeshttps://doi.org/10.1002/rsa.20067openalex-snapshot
Probabilistic behavior of asymmetric level compressed tries
inferred← citeshttps://doi.org/10.1002/rsa.20979openalex-snapshot
Node profiles of symmetric digital search trees: Concentration properties
inferred← citeshttps://doi.org/10.1002/rsa.3240030209openalex-snapshot
A note on the probabilistic analysis of patricia trees
inferred← citeshttps://doi.org/10.1007/10719839_31openalex-snapshot
Heights in Generalized Tries and PATRICIA Tries
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_87openalex-snapshot
Grid file algorithms: An analysis in the biased case
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_44openalex-snapshot
Average complexity of additive properties for multiway tries: A unified approach
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_13openalex-snapshot
On an alternative sum useful in the analysis of some data structures
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_35openalex-snapshot
Analysis of compact 0-complete trees: A new access method to large databases
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_18openalex-snapshot
Digital data structures and order statistics
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_13openalex-snapshot
The Nested Interpolation Based Grid File
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_6openalex-snapshot
Trie Hashing : Further Properties and Performance
inferred← citeshttps://doi.org/10.1007/978-3-319-08608-8_17openalex-snapshot
A Functional Database Representation of Large Sets of Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_9openalex-snapshot
On the Smoothed Heights of Trie and Patricia Index Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
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/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of trees
inferred← citeshttps://doi.org/10.1007/bf01178777openalex-snapshot
A robust and efficient spatial data structure
inferred← citeshttps://doi.org/10.1007/bf01759045openalex-snapshot
On the height of digital trees and related problems
inferred← citeshttps://doi.org/10.1007/bf01934457openalex-snapshot
Interpolation-based index maintenance
inferred← citeshttps://doi.org/10.1007/bf01939359openalex-snapshot
Brownian motion and algorithm complexity
inferred← citeshttps://doi.org/10.1007/bf02679623openalex-snapshot
Dynamical sources in information theory: A general analysis of trie structures
inferred← citeshttps://doi.org/10.1007/bfb0022669openalex-snapshot
Trie partitioning process: Limiting distributions
inferred← citeshttps://doi.org/10.1007/bfb0028265openalex-snapshot
What can we learn about suffix trees from independent tries?
inferred← citeshttps://doi.org/10.1007/bfb0049399openalex-snapshot
Faster searching in tries and quadtrees—An analysis of level compression
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/pl00009239openalex-snapshot
A Note on the Asymptotic Behavior of the Depth of Tries
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.1007/s00453-004-1137-7openalex-snapshot
Universal Asymptotics for Random Tries and PATRICIA Trees
inferred← citeshttps://doi.org/10.1007/s236-002-8034-5openalex-snapshot
The variance of the height of digital search trees
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00133-4openalex-snapshot
Some results on the asymptotic behaviour of coefficients of large powers of functions
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/0020-0190(88)90086-5openalex-snapshot
A study of page arrangements for extendible hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90137-8openalex-snapshot
The evaluation of an alternative sum with applications to the analysis of some data structures
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90068-kopenalex-snapshot
Improved behaviour of tries by adaptive branching
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90070-popenalex-snapshot
A note on binomial recurrences arising in the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90118-sopenalex-snapshot
Performance analysis of a main memory multi-directory hashing technique
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90262-8openalex-snapshot
An approximate analysis of the performance of extendible hashing with elastic buckets
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90065-5openalex-snapshot
Autocorrelation on words and its applications
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90039-9openalex-snapshot
Some results on V-ary asymmetric tries
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90049-iopenalex-snapshot
Self-alignments in words and their applications
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90050-copenalex-snapshot
A characterization of digital search trees from the successful search viewpoint
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90262-eopenalex-snapshot
Probabilistic modeling of data structures on words
inferred← citeshttps://doi.org/10.1016/0306-4379(95)00002-lopenalex-snapshot
Gras, a graph-oriented (software) engineering database system
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.024openalex-snapshot
An analytic approach to the asymptotic variance of trie statistics and related structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.009openalex-snapshot
Smoothed heights of tries and patricia tries
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10066-4openalex-snapshot
A substring search algorithm in extendible hashing
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00365-2openalex-snapshot
Expected worst-case partial match in random quadtries
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00212-2openalex-snapshot
Limit laws for the height in PATRICIA tries
inferred← citeshttps://doi.org/10.1016/s0377-0427(01)00458-7openalex-snapshot
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
inferred← citeshttps://doi.org/10.1017/s0963548304006200openalex-snapshot
Concentration of Size and Path Length of Tries
inferred← citeshttps://doi.org/10.1017/s0963548307008796openalex-snapshot
An Analysis of the Height of Tries with Random Weights on the Edges
inferred← citeshttps://doi.org/10.1023/a:1026258911996openalex-snapshot
Average Case Analysis in Database Problems
inferred← citeshttps://doi.org/10.1051/ita:2001114openalex-snapshot
On the Stack-Size of General Tries
inferred← citeshttps://doi.org/10.1109/18.133271openalex-snapshot
Analysis of digital tries with Markovian dependency
inferred← citeshttps://doi.org/10.1109/71.89070openalex-snapshot
Performance of shared memory in a parallel computer
inferred← citeshttps://doi.org/10.1109/icde.1988.105506openalex-snapshot
Linearizing the directory growth in order preserving extendible hashing
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.80openalex-snapshot
K-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.1109/sfcs.1983.76openalex-snapshot
The program complexity of searching a table
inferred← citeshttps://doi.org/10.1137/0406016openalex-snapshot
Limiting Distribution for the Depth in PATRICIA Tries
inferred← citeshttps://doi.org/10.1137/1.9781611974775.12openalex-snapshot
External Profile of Symmetric Digital Search Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1137/s0097539797326174openalex-snapshot
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
inferred← citeshttps://doi.org/10.1142/s0219427900000028openalex-snapshot
An Efficient Retrieval Algorithm of Compound Words Using Extendible Hashing
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/114325.103714openalex-snapshot
A dynamic hash method with signature
inferred← citeshttps://doi.org/10.1145/130283.130317openalex-snapshot
Fast search in main memory databases
inferred← citeshttps://doi.org/10.1145/141484.130317openalex-snapshot
Fast search in main memory databases
inferred← citeshttps://doi.org/10.1145/1462198.1462202openalex-snapshot
Information filtering and query indexing for an information retrieval model
inferred← citeshttps://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/588011.588036openalex-snapshot
Index maintenance for non-uniform record distributions
inferred← citeshttps://doi.org/10.1145/6012.6015openalex-snapshot
Balanced multidimensional extendible hash tree
inferred← citeshttps://doi.org/10.1214/aoap/1035463332openalex-snapshot
On the distribution for the duration of a randomized leader election algorithm
inferred← citeshttps://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_111openalex-snapshot
k-Selection Protocols from Energetic Complexity Perspective
inferred← citeshttps://doi.org/10.25904/1912/931openalex-snapshot
Indexing Multidimensional Point Data
inferred← citeshttps://doi.org/10.37236/1517openalex-snapshot
A Note on the Asymptotic Behavior of the Heights in $b$-Tries for $b$ Large
inferred← citeshttps://doi.org/10.46298/dmtcs.301openalex-snapshot
The Stack-Size of Combinatorial Tries Revisited
inferred← citeshttps://doi.org/10.46298/dmtcs.3517openalex-snapshot
Concentration Properties of Extremal Parameters in Random Discrete Structures
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.