On the public citation graph
Page usage in a quadtree index
0 signed · 35 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/rsa.3240030309openalex-snapshot
Generalized Digital Trees and Their Difference—Differential Equations
inferredcites →https://doi.org/10.1006/jsco.2000.0368openalex-snapshot
On Solutions of Linear Ordinary Difference Equations in their Coefficient Field
inferredcites →https://doi.org/10.1007/bf00264279openalex-snapshot
On the performance evaluation of extendible hashing and trie searching
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bf00299632openalex-snapshot
Transforming Unbalanced Multiway trees into a practical external data structure
inferredcites →https://doi.org/10.1016/0196-6774(89)90023-0openalex-snapshot
Analysis of the space of search trees under the random insertion algorithm
inferredcites →https://doi.org/10.1137/0219057openalex-snapshot
An Analysis of Random d -Dimensional Quad Trees
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
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)1098-2418(199710)11:3<223::aid-rsa2>3.0.co;2-2openalex-snapshot
Patterns in random binary search trees
inferred← citeshttps://doi.org/10.1002/rsa.3240070203openalex-snapshot
Hypergeometrics and the cost structure of quadtrees
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_8openalex-snapshot
Arbres m-aires et quadrants
inferred← citeshttps://doi.org/10.1007/bf02574372openalex-snapshot
Search costs in quadtrees and singularity perturbation asymptotics
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s00236-004-0148-9openalex-snapshot
The size of random bucket trees via urn models
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00137-8openalex-snapshot
Sur la distribution de l'arité de la racine d'une arborescence hyperquaternaire à d dimensions
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00137-lopenalex-snapshot
Etude de constantes universelles pour les arborescences hyperquaternaires de recherche
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90103-5openalex-snapshot
Combinatorial variations on multidimensional quadtrees
inferred← citeshttps://doi.org/10.1016/j.cam.2004.04.014openalex-snapshot
Singularity analysis, Hadamard products, and tree recurrences
inferred← citeshttps://doi.org/10.1016/j.jcam.2004.04.014openalex-snapshot
Singularity analysis, Hadamard products, and tree recurrences
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00210-9openalex-snapshot
A multivariate view of random bucket digital search trees
inferred← citeshttps://doi.org/10.1017/s0269964800003776openalex-snapshot
Toward a Formal Derivation of the Expected Behavior of Prefix B-Trees
inferred← citeshttps://doi.org/10.1051/ita/2017002openalex-snapshot
Analysis of digital search trees incorporated with paging
inferred← citeshttps://doi.org/10.1137/s0097539700368527openalex-snapshot
A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases
inferred← citeshttps://doi.org/10.1137/s009753979223023xopenalex-snapshot
The Joint Distribution of Elastic Buckets in Multiway Search Trees
inferred← citeshttps://doi.org/10.1142/s1793830917500215openalex-snapshot
On the size of paged recursive trees
inferred← citeshttps://doi.org/10.1145/1240233.1240235openalex-snapshot
Phase changes in random point quadtrees
inferred← citeshttps://doi.org/10.37236/1358openalex-snapshot
On the Number of Descendants and Ascendants in Random Search Trees
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.