On the public citation graph

Dividedk-d trees

0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1027openalex-snapshot
Concatenable Structures for Decomposable Problems
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-71071-1_11openalex-snapshot
Bibliography on quadtrees and related hierarchical data structures
inferredcites →https://doi.org/10.1007/bf00264354openalex-snapshot
Dynamic multi-dimensional data structures based on quad- and k—d 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/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(81)90093-4openalex-snapshot
Worst-case optimal insertion and deletion methods for decomposable searching problems
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1145/359038.359043openalex-snapshot
Deletion in two-dimensional quad trees
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1999.2811openalex-snapshot
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_17openalex-snapshot
K-D Trees Are Better when Cut on the Longest Side
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_17openalex-snapshot
Optimal Dynamic Range Searching inNon-replicating Index Structures
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_22openalex-snapshot
Randomized K-Dimensional Binary Search Trees
inferred← citeshttps://doi.org/10.1007/3-540-60159-7_9openalex-snapshot
Extending a spatial access structure to support additional standard attributes
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_215openalex-snapshot
Efficient splitting and merging algorithms for order decomposable problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory 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-319-15579-1_45openalex-snapshot
Compressed Data Structures for Range Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_3openalex-snapshot
Orthogonal Range Searching in Linear and Almost-Linear Space
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
inferred← citeshttps://doi.org/10.1007/978-3-642-79646-3_13openalex-snapshot
Die Nutzung mehrdimensionaler Zugriffsstrukturen für Anfragen über Standardattributen
inferred← citeshttps://doi.org/10.1007/bfb0029010openalex-snapshot
Concatenable segment trees
inferred← citeshttps://doi.org/10.1007/s00453-007-9030-9openalex-snapshot
Space Efficient Dynamic Orthogonal Range Reporting
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.09.001openalex-snapshot
Orthogonal range searching in linear and almost-linear space
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00128-8openalex-snapshot
Efficient dynamic range searching using data replication
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/ccaa.2015.7148464openalex-snapshot
VM selection framework for market based federated cloud environment
inferred← citeshttps://doi.org/10.1109/icde.1996.492090openalex-snapshot
Improving the performance of multi-dimensional access structures based on k-d-trees
inferred← citeshttps://doi.org/10.1109/icde.1998.655799openalex-snapshot
The LSD/sup h/-tree: an access structure for feature vectors
inferred← citeshttps://doi.org/10.1109/iciea.2015.7334089openalex-snapshot
Tree trunk detection system using LiDAR for a semi-autonomous tree felling robot
inferred← citeshttps://doi.org/10.1109/icip.1995.537636openalex-snapshot
Object manipulation for document conversion
inferred← citeshttps://doi.org/10.1137/070710731openalex-snapshot
Kinetic kd-Trees and Longest-Side kd-Trees
inferred← citeshttps://doi.org/10.1142/s0218195909002800openalex-snapshot
A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
inferred← citeshttps://doi.org/10.1145/1064092.1064139openalex-snapshot
Space efficient dynamic orthogonal range reporting
inferred← citeshttps://doi.org/10.1145/238355.238367openalex-snapshot
Adapting a spatial access structure for document representations in vector space
inferred← citeshttps://doi.org/10.1145/258319.258323openalex-snapshot
A hybrid split strategy for k-d-tree based access structures
inferred← citeshttps://doi.org/10.1145/2791405.2791560openalex-snapshot
A Multi-Objective Initial Virtual Machine Allocation in Clouds using Divided KD Tree
inferred← citeshttps://doi.org/10.1145/3709712openalex-snapshot
Parallel kd-tree with Batch Updates
inferred← citeshttps://doi.org/10.1201/9781584888239-c10openalex-snapshot
External-Memory Algorithms and Data Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00208openalex-snapshot
An Optimal Algorithm for Range Search on Multidimensional Points
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.