On the public citation graph
Linear space data structures for two types of range search
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/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1016/0020-0190(86)90088-8openalex-snapshot
Halfplanar range search in linear space and O(n0.695) query time
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/s0747-7171(85)80028-6openalex-snapshot
Optimal solutions for a class of point retrieval problems
inferredcites →https://doi.org/10.1109/sfcs.1984.715939openalex-snapshot
Space Searching For Intersecting Objects
inferredcites →https://doi.org/10.1109/sfcs.1985.51openalex-snapshot
Slimming down search structures: A functional approach to algorithm design
inferredcites →https://doi.org/10.1109/sfcs.1986.29openalex-snapshot
Lower bounds on the complexity of multidimensional searching
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
inferredcites →https://doi.org/10.1145/800061.808755openalex-snapshot
A 3-space partition and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_13openalex-snapshot
Dynamic data structures for realtime management of large geometric scenes
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_21openalex-snapshot
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_2openalex-snapshot
Point Enclosure Problem for Homothetic Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_31openalex-snapshot
Dominance for Enclosure Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_49openalex-snapshot
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_4openalex-snapshot
On Dominance Reporting in 3D
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_22openalex-snapshot
Space Efficient Multi-dimensional Range Reporting
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_59openalex-snapshot
An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine
inferred← citeshttps://doi.org/10.1007/s10878-025-01373-5openalex-snapshot
Dominance for enclosure problems
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90189-oopenalex-snapshot
The intersection searching problem for c-oriented polygons
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00075-1openalex-snapshot
Algorithms for three-dimensional dominance searching in linear space
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00013-4openalex-snapshot
Extending range queries and nearest neighbors
inferred← citeshttps://doi.org/10.1051/ita/1989230201651openalex-snapshot
An application of $m$-ary trees to the design of data structures for geometric searching problems
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/3ca.2010.5533737openalex-snapshot
An optimal two-dimensional orthogonal range search algorithm in VLSI, design automation
inferred← citeshttps://doi.org/10.1109/icde.2005.137openalex-snapshot
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892088openalex-snapshot
New data structures for orthogonal range searching
inferred← citeshttps://doi.org/10.1137/1.9781611976465.73openalex-snapshot
New Data Structures for Orthogonal Range Reporting and Range Minima Queries
inferred← citeshttps://doi.org/10.1137/s0097539703435728openalex-snapshot
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/2594538.2594557openalex-snapshot
Categorical range maxima queries
inferred← citeshttps://doi.org/10.1145/3209685openalex-snapshot
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
inferred← citeshttps://doi.org/10.1145/3546074openalex-snapshot
Generic Techniques for Building Top- k Structures
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/77600.77614openalex-snapshot
Lower bounds for orthogonal range searching: I. The reporting case
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.21236/ada230380openalex-snapshot
Results in Computational Geometry: Geometric Embeddings and Query- Retrieval Problems
inferred← citeshttps://doi.org/10.25596/jalc-2003-633openalex-snapshot
Rectangle Enclosure Reporting in Linear Space Revisited
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.785openalex-snapshot
Efficient Indexing for Structured and Unstructured Data
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.59openalex-snapshot
Four-Dimensional Dominance Range Reporting in Linear Space
inferred← citeshttps://doi.org/10.48550/arxiv.1910.01147openalex-snapshot
Path and Ancestor Queries on Trees with Multidimensional Weight Vectors
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.