On the public citation graph
Search costs in quadtrees and singularity perturbation asymptotics
0 signed · 56 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/3-540-55251-0_2openalex-snapshot
Varieties of increasing trees
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bfb0022669openalex-snapshot
Trie partitioning process: Limiting distributions
inferredcites →https://doi.org/10.1016/0012-365x(93)90364-yopenalex-snapshot
General combinatorial schemas: Gaussian limit distributions and exponential tails
inferredcites →https://doi.org/10.1016/0016-0032(56)91150-4openalex-snapshot
Theory of ordinary differential equations
inferredcites →https://doi.org/10.1016/0097-3165(73)90038-1openalex-snapshot
Central and local limit theorems applied to asymptotic enumeration
inferredcites →https://doi.org/10.1016/0097-3165(90)90056-3openalex-snapshot
Gaussian limiting distributions for the number of components in combinatorial structures
inferredcites →https://doi.org/10.1016/0097-3165(94)90011-6openalex-snapshot
Asymptotic distributions and a multivariate darboux method in enumeration problems
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.1016/0304-3975(77)90034-2openalex-snapshot
On the analysis of algorithms for trees
inferredcites →https://doi.org/10.1016/0377-0427(92)90247-uopenalex-snapshot
Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions
inferredcites →https://doi.org/10.1016/0378-4754(90)90088-zopenalex-snapshot
Algorithms (2nd edition)
inferredcites →https://doi.org/10.1051/ita/197610r300351openalex-snapshot
Arbres binaires de recherche : propriétés combinatoires et applications
inferredcites →https://doi.org/10.1051/ita/1987210404791openalex-snapshot
Exact and asymptotic distributions in digital and binary search trees
inferredcites →https://doi.org/10.1063/1.3059875openalex-snapshot
Theory of Ordinary Differential Equations
inferredcites →https://doi.org/10.1093/comjnl/7.4.299openalex-snapshot
More Combinatorial Properties of Certain Trees
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/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
inferredcites →https://doi.org/10.2307/2323585openalex-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/(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/(sici)1098-2418(199908)15:1<25::aid-rsa2>3.0.co;2-ropenalex-snapshot
On the internal path length ofd-dimensional quad trees
inferred← citeshttps://doi.org/10.1002/rsa.10010openalex-snapshot
On a multivariate contraction method for random recursive structures with applications to Quicksort
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/978-3-540-30551-4_37openalex-snapshot
Randomized Insertion and Deletion in Point Quad Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_7openalex-snapshot
Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bf02679611openalex-snapshot
The contraction method for recursive algorithms
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s00285-015-0941-9openalex-snapshot
Stochastic analysis of the extra clustering model for animal grouping
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50024-5openalex-snapshot
10.1016/b978-044488002-4/50024-5
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100904openalex-snapshot
The analysis of partial match queries in random multidimensional trees: A selected survey
inferred← citeshttps://doi.org/10.1016/j.spa.2018.08.014openalex-snapshot
A limit field for orthogonal range searches in two-dimensional random point search trees
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00372-0openalex-snapshot
Analytic combinatorics of non-crossing configurations
inferred← citeshttps://doi.org/10.1109/rcar52367.2021.9517535openalex-snapshot
Saturated nonlinear control of robots with series elastic actuators
inferred← citeshttps://doi.org/10.1137/1.9781611973099.83openalex-snapshot
Partial match queries in random quadtrees
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/s0097539702412131openalex-snapshot
Partial Match Queries in Random Quadtrees
inferred← citeshttps://doi.org/10.1137/s0097539703437491openalex-snapshot
Partial Match Queries in Random k-d Trees
inferred← citeshttps://doi.org/10.1137/s0097539795283954openalex-snapshot
Universal Limit Laws for Depths in Random Trees
inferred← citeshttps://doi.org/10.1145/1240233.1240235openalex-snapshot
Phase changes in random point quadtrees
inferred← citeshttps://doi.org/10.1214/12-aap912openalex-snapshot
A limit process for partial match queries in random quadtrees and $2$-d trees
inferred← citeshttps://doi.org/10.1214/19-aop1411openalex-snapshot
Periodic Pólya urns, the density method and asymptotics of Young tableaux
inferred← citeshttps://doi.org/10.1214/ejp.v16-885openalex-snapshot
On the Moment-Transfer Approach for Random Variables Satisfying a One-Sided Distributional Recurrence
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.