On the public citation graph
A branching process arising in dynamic hashing, trie searching and polynomial factorization
0 signed · 42 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.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/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferredcites →https://doi.org/10.1016/0029-5582(60)90320-5openalex-snapshot
Asymptotic methods in analysis
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0606517-5openalex-snapshot
A New Algorithm for Factoring Polynomials Over Finite Fields
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/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/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.1006/jagm.2001.1158openalex-snapshot
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_100openalex-snapshot
Methods in the analysis of algorithms : Evaluations of a recursive partitioning process
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/bf00264248openalex-snapshot
A probabilistic analysis of the height of tries and of the complexity of triesort
inferred← citeshttps://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferred← citeshttps://doi.org/10.1007/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of trees
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/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s00200-021-00536-1openalex-snapshot
Univariate polynomial factorization over large finite fields
inferred← citeshttps://doi.org/10.1007/s00453-004-1137-7openalex-snapshot
Universal Asymptotics for Random Tries and PATRICIA Trees
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/s0166-218x(03)00365-2openalex-snapshot
Expected worst-case partial match in random quadtries
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73107-4openalex-snapshot
Algebraic Methods for Trie Statistics
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/s0001867800015603openalex-snapshot
Paths in a random digital tree: limiting distributions
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.1145/2755996.2756647openalex-snapshot
Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
inferred← citeshttps://doi.org/10.1214/aoap/1177005709openalex-snapshot
A Study of Trie-Like Structures Under the Density Model
inferred← citeshttps://doi.org/10.5802/ccirm.18openalex-snapshot
Factorisation des polynômes à plusieurs variables
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.