On the public citation graph
Partial match queries in relaxed multidimensional search trees
0 signed · 50 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.3240050112openalex-snapshot
Multidimensional digital searching—alternative data structures
inferredcites →https://doi.org/10.1002/rsa.3240070106openalex-snapshot
The variance of a partial match retrieval in a multidimensional symmetric trie
inferredcites →https://doi.org/10.1007/3-540-49381-6_22openalex-snapshot
Randomized K-Dimensional Binary Search Trees
inferredcites →https://doi.org/10.1007/3-540-51542-9_4openalex-snapshot
Analysis of kdt-trees: Kd-trees improved by local reorganisations
inferredcites →https://doi.org/10.1007/3-540-63165-8_201openalex-snapshot
An improved master theorem for divide-and-conquer recurrences
inferredcites →https://doi.org/10.1016/0304-3975(94)00281-mopenalex-snapshot
Mellin transforms and asymptotics: Finite differences and Rice's integrals
inferredcites →https://doi.org/10.1016/0924-2716(91)90007-iopenalex-snapshot
The design and analysis of spatial data structures
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1142/s0129054193000055openalex-snapshot
MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
inferredcites →https://doi.org/10.1145/320455.320469openalex-snapshot
Hashing and trie algorithms for partial match retrieval
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
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/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1098-2418(200010/12)17:3/4<403::aid-rsa11>3.0.co;2-kopenalex-snapshot
Asymptotic distributions for partial match queries inK-d trees
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.20476openalex-snapshot
Selection by rank in K‐dimensional binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_26openalex-snapshot
An Interactive Framework for Open Queries in Decision Support Systems
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/978-3-031-20624-5_3openalex-snapshot
Median and Hybrid Median K-Dimensional Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_58openalex-snapshot
Rank Selection in Multidimensional Data
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/s00236-008-0069-0openalex-snapshot
Weighted height of random trees
inferred← citeshttps://doi.org/10.1007/s002360000044openalex-snapshot
Analysis of range search for random k-d trees
inferred← citeshttps://doi.org/10.1007/s00453-015-0097-4openalex-snapshot
On the Cost of Fixed Partial Match Queries in K-d Trees
inferred← citeshttps://doi.org/10.1007/s44007-024-00090-5openalex-snapshot
On the Expected Cost of Partial Match Queries in Random Quad-K-d Trees
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.datak.2010.10.006openalex-snapshot
Dealing with complex queries in decision-support systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.12.015openalex-snapshot
Reductions in binary search trees
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)00213-4openalex-snapshot
On the average performance of orthogonal range search in multidimensional data structures
inferred← citeshttps://doi.org/10.1137/1.9781611972979.4openalex-snapshot
On the average cost of insertions on random relaxed K-d trees
inferred← citeshttps://doi.org/10.1137/1.9781611974775.13openalex-snapshot
Partial Match Queries in Relaxed K-dt trees
inferred← citeshttps://doi.org/10.1137/s0097539703425873openalex-snapshot
Distributional Results for Costs of Partial Match Queries in Asymmetric K -Dimensional Tries
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.1214/12-aap912openalex-snapshot
A limit process for partial match queries in random quadtrees and $2$-d trees
inferred← citeshttps://doi.org/10.1214/aoap/1015345300openalex-snapshot
Limit laws for partial match queries in quadtrees
inferred← citeshttps://doi.org/10.20868/upm.thesis.1701openalex-snapshot
Listas KBM2L para la síntesis de conocimiento en sistemas de ayuda a la decisión
inferred← citeshttps://doi.org/10.3233/fun-2007-81403openalex-snapshot
Binary Search Trees, Recurrent Properties andWave Equations
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.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.