On the public citation graph
Analytic variations on quadtrees
0 signed · 97 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/bf00265991openalex-snapshot
Branching processes in the analysis of the heights of 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/bf02189391openalex-snapshot
Asymptotic expansions for the coefficients of analytic generating functions
inferredcites →https://doi.org/10.1007/bf02574372openalex-snapshot
Search costs in quadtrees and singularity perturbation asymptotics
inferredcites →https://doi.org/10.1016/0016-0032(67)90120-2openalex-snapshot
Asymptotic expansions for ordinary differential equations
inferredcites →https://doi.org/10.1016/0020-0190(75)90034-4openalex-snapshot
Analysis of range searches in quad trees
inferredcites →https://doi.org/10.1016/0020-0190(87)90043-3openalex-snapshot
Average efficiency of data structures for binary image processing
inferredcites →https://doi.org/10.1016/0020-0190(89)90156-7openalex-snapshot
On the average number of maxima in a set of vectors
inferredcites →https://doi.org/10.1016/0022-247x(85)90209-4openalex-snapshot
Resurrecting the asymptotics of linear recurrences
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/0098-3004(91)90117-vopenalex-snapshot
The design and analysis of spatial data structures
inferredcites →https://doi.org/10.1016/0377-0427(90)90042-xopenalex-snapshot
A holonomic systems approach to special functions identities
inferredcites →https://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferredcites →https://doi.org/10.1051/ita/1987210404791openalex-snapshot
Exact and asymptotic distributions in digital and binary search 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/323233.323268openalex-snapshot
Quadtrees, octrees, hyperoctrees
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferredcites →https://doi.org/10.2307/1266136openalex-snapshot
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.3929/ethz-a-000628396openalex-snapshot
On solutions of linear ordinary differential equations in their coefficient field
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(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.20428openalex-snapshot
Psi-series method for equality of random trees and quadratic convolution recurrences
inferred← citeshttps://doi.org/10.1002/rsa.3240070203openalex-snapshot
Hypergeometrics and the cost structure of quadtrees
inferred← citeshttps://doi.org/10.1006/jvci.1998.0374openalex-snapshot
Image Segmentation with Topological Maps and Inter-pixel Representation
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_44openalex-snapshot
On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_2openalex-snapshot
Varieties of increasing trees
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_201openalex-snapshot
An improved master theorem for divide-and-conquer recurrences
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-49529-2_28openalex-snapshot
Random Partial Match in Quad-K-d Trees
inferred← citeshttps://doi.org/10.1007/bf02574372openalex-snapshot
Search costs in quadtrees and singularity perturbation asymptotics
inferred← citeshttps://doi.org/10.1007/bf02679611openalex-snapshot
The contraction method for recursive algorithms
inferred← citeshttps://doi.org/10.1007/bf02679618openalex-snapshot
Partial match queries in relaxed multidimensional search trees
inferred← citeshttps://doi.org/10.1007/bf02704178openalex-snapshot
Understanding search trees via statistical physics
inferred← citeshttps://doi.org/10.1007/pl00009230openalex-snapshot
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics
inferred← citeshttps://doi.org/10.1007/s002360000044openalex-snapshot
Analysis of range search for random k-d trees
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/0167-8655(95)00072-oopenalex-snapshot
A random model for analyzing region quadtrees
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50008-5openalex-snapshot
Applications of Computational Geometry to Geographic Information Systems
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.cam.2004.04.014openalex-snapshot
Singularity analysis, Hadamard products, and tree recurrences
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.jcam.2004.04.014openalex-snapshot
Singularity analysis, Hadamard products, and tree recurrences
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/j.tcs.2005.09.074openalex-snapshot
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh–Hadamard transform
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.030openalex-snapshot
Quad-kd trees: A general framework for kd trees and quad trees
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00213-4openalex-snapshot
On the average performance of orthogonal range search in multidimensional data structures
inferred← citeshttps://doi.org/10.1016/s1047-3203(03)00023-3openalex-snapshot
Incremental modifications of segmented image defined by discrete maps
inferred← citeshttps://doi.org/10.1017/s0001867800004742openalex-snapshot
Partial match queries in two-dimensional quadtrees: a probabilistic approach
inferred← citeshttps://doi.org/10.1017/s096354831200017xopenalex-snapshot
Strong Convergence of Partial Match Queries in Random Quadtrees
inferred← citeshttps://doi.org/10.1080/02693799608902097openalex-snapshot
Natural trees neighbourhood-location in a nutshell
inferred← citeshttps://doi.org/10.1109/icde.1998.655808openalex-snapshot
Processing incremental multidimensional range queries in a direct manipulation visual query environment
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00170openalex-snapshot
Towards Efficient MIT query in Trajectory Data
inferred← citeshttps://doi.org/10.1109/tkde.2024.3361948openalex-snapshot
On Efficiently Processing MIT Queries in Trajectory Data
inferred← citeshttps://doi.org/10.1137/1.9781611973099.83openalex-snapshot
Partial match queries in random quadtrees
inferred← citeshttps://doi.org/10.1137/1.9781611974775.13openalex-snapshot
Partial Match Queries in Relaxed K-dt trees
inferred← citeshttps://doi.org/10.1137/1.9781611975499.14openalex-snapshot
A Practical Algorithm for Spatial Agglomerative Clustering
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.1145/1240233.1240235openalex-snapshot
Phase changes in random point quadtrees
inferred← citeshttps://doi.org/10.1145/375827.375837openalex-snapshot
Improved master theorems for divide-and-conquer recurrences
inferred← citeshttps://doi.org/10.1214/105051606000000187openalex-snapshot
Width and mode of the profile for some random trees of logarithmic height
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/13-aop894openalex-snapshot
The dual tree of a recursive triangulation of the disk
inferred← citeshttps://doi.org/10.1214/aoap/1015345300openalex-snapshot
Limit laws for partial match queries in quadtrees
inferred← citeshttps://doi.org/10.1239/aap/1300198518openalex-snapshot
Partial match queries in two-dimensional quadtrees: a probabilistic approach
inferred← citeshttps://doi.org/10.37236/1894openalex-snapshot
On the Non-Holonomic Character of Logarithms, Powers, and the $n$th Prime Function
inferred← citeshttps://doi.org/10.46298/dmtcs.3369openalex-snapshot
Algorithmic and combinatoric aspects of multiple harmonic sums
inferred← citeshttps://doi.org/10.46298/dmtcs.3484openalex-snapshot
Around the root of random multidimensional quadtrees
inferred← citeshttps://doi.org/10.48550/arxiv.1002.3859openalex-snapshot
Psi-series method in random trees and moments of high orders
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5579openalex-snapshot
Strong convergence of partial match queries in random quadtrees
inferred← citeshttps://doi.org/10.48550/arxiv.math/0505255openalex-snapshot
Symmetric inclusion-exclusion
inferred← citeshttps://doi.org/10.48550/arxiv.math/0510042openalex-snapshot
Counting the Chain Records: The Product Case
inferred← citeshttps://doi.org/10.5555/1283383.1283399openalex-snapshot
Analytic combinatorics: a calculus of discrete structures
inferred← citeshttps://doi.org/10.5821/dissertation-2117-177248openalex-snapshot
Analysis of partial match queries in multidimensional search trees
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot
Design and Analysis of Multidimensional Data 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.