On the public citation graph
On the height of digital trees and related problems
0 signed · 78 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-1-4757-6283-9openalex-snapshot
Probability Approximations via the Poisson Clumping Heuristic
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf00264248openalex-snapshot
A probabilistic analysis of the height of tries and of the complexity of triesort
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf00536046openalex-snapshot
A class of dependent random variables and their maxima
inferredcites →https://doi.org/10.1007/bfb0022669openalex-snapshot
Trie partitioning process: Limiting distributions
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/0166-218x(89)90050-4openalex-snapshot
On the variance of the external path length in a symmetric digital trie
inferredcites →https://doi.org/10.1016/0196-6774(88)90039-9openalex-snapshot
Some results on V-ary asymmetric tries
inferredcites →https://doi.org/10.1016/b978-0-12-702101-0.50014-7openalex-snapshot
THE ASYMPTOTIC THEORY OF EXTREME ORDER STATISTICS
inferredcites →https://doi.org/10.1017/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
inferredcites →https://doi.org/10.1017/s0001867800016578openalex-snapshot
Counts of long aligned word matches among random letter sequences
inferredcites →https://doi.org/10.1017/s0021900200111799openalex-snapshot
Probabilistic analysis of optimum partitioning
inferredcites →https://doi.org/10.1080/00401706.1990.10484616openalex-snapshot
The Asymptotic Theory of Extreme Order Statistics
inferredcites →https://doi.org/10.1109/tit.1979.1056093openalex-snapshot
Tree algorithms for packet broadcast channels
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1214/aop/1176993000openalex-snapshot
Asymptotical Growth of a Class of Random Trees
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
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.1002/rsa.3240030209openalex-snapshot
A note on the probabilistic analysis of patricia trees
inferred← citeshttps://doi.org/10.1002/rsa.3240040206openalex-snapshot
A probabilistic analysis of a pattern matching problem
inferred← citeshttps://doi.org/10.1007/10719839_31openalex-snapshot
Heights in Generalized Tries and PATRICIA Tries
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_16openalex-snapshot
Complexity of Sequential Pattern Matching Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_64openalex-snapshot
Combinatorial optimization through order statistics
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_1openalex-snapshot
Probabilistic analysis of generalized suffix trees
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_3openalex-snapshot
Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-46049-9_18openalex-snapshot
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
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/bfb0028265openalex-snapshot
What can we learn about suffix trees from independent tries?
inferred← citeshttps://doi.org/10.1007/pl00009207openalex-snapshot
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal
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/s00778-010-0183-9openalex-snapshot
Engineering scalable, cache and space efficient tries for strings
inferred← citeshttps://doi.org/10.1007/s10878-013-9682-0openalex-snapshot
Computing the shortest reset words of synchronizing automata
inferred← citeshttps://doi.org/10.1007/s11009-008-9092-4openalex-snapshot
Random Databases with Approximate Record Matching
inferred← citeshttps://doi.org/10.1007/s11786-017-0296-2openalex-snapshot
Faster Average Case Low Memory Semi-external Construction of the Burrows–Wheeler Transform
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/0097-3165(94)90065-5openalex-snapshot
Autocorrelation on words and its applications
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/j.ic.2019.01.006openalex-snapshot
Lempel–Ziv compressed structures for document retrieval
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.029openalex-snapshot
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
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/s0304-3975(97)00089-3openalex-snapshot
Asymptotic properties of keys and functional dependencies in random databases
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.1080/02331939508844086openalex-snapshot
Combinational optimization problems for which almost every algorithm is asymptotically optimal
inferred← citeshttps://doi.org/10.1090/conm/677/13619openalex-snapshot
Generic properties of subgroups of free groups and finite presentations
inferred← citeshttps://doi.org/10.1109/18.133271openalex-snapshot
Analysis of digital tries with Markovian dependency
inferred← citeshttps://doi.org/10.1109/18.259648openalex-snapshot
Asymptotic properties of data compression and suffix trees
inferred← citeshttps://doi.org/10.1109/dcc.1991.213356openalex-snapshot
A typical behavior of some data compression schemes
inferred← citeshttps://doi.org/10.1109/sccc.1998.730797openalex-snapshot
Behavior of keys in random databases
inferred← citeshttps://doi.org/10.1137/0222070openalex-snapshot
A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
inferred← citeshttps://doi.org/10.1137/s0097539799356812openalex-snapshot
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
inferred← citeshttps://doi.org/10.1145/1290672.1290681openalex-snapshot
Partial fillup and search time in LC tries
inferred← citeshttps://doi.org/10.1145/133057.133087openalex-snapshot
Subexponential tail distribution in LaPalice queues
inferred← citeshttps://doi.org/10.1145/149439.133087openalex-snapshot
Subexponential tail distribution in LaPalice queues
inferred← citeshttps://doi.org/10.1145/1671970.1921704openalex-snapshot
Redesigning the string hash table, burst trie, and BST to exploit cache
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.48550/arxiv.2003.04101openalex-snapshot
Smoothed Analysis of Trie Height by Star-like PFAs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0510017openalex-snapshot
Partial fillup and search time in LC tries
inferred← citeshttps://doi.org/10.5555/1070432.1070438openalex-snapshot
Towards a complete characterization of tries
inferred← citeshttps://doi.org/10.5555/1283383.1283479openalex-snapshot
Multiple choice tries and distributed hash tables
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.