On the public citation graph
Filtering search: A new approach to query-answering
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/bf00263991openalex-snapshot
Efficient worst-case data structures for range searching
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bf01933636openalex-snapshot
The rectangle intersection problem revisited
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(82)90090-4openalex-snapshot
Polygonal intersection searching
inferredcites →https://doi.org/10.1016/0020-0190(83)90123-0openalex-snapshot
An improved algorithm for the fixed-radius neighbor problem
inferredcites →https://doi.org/10.1016/0146-664x(80)90034-9openalex-snapshot
Data structures for the rectangle containment and enclosure problems
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0196-6774(81)90008-0openalex-snapshot
Segments, rectangles, contours
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1109/sfcs.1977.6openalex-snapshot
Applications of a planar separator theorem
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1109/sfcs.1981.5openalex-snapshot
A direct dynamic solution to range search and related problems for product regions
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/tc.1979.1675432openalex-snapshot
Algorithms for Reporting and Counting Geometric Intersections
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1109/tc.1982.1675973openalex-snapshot
Counting and Reporting Intersections of d-Ranges
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0210001openalex-snapshot
Lower Bounds on the Complexity of Some Optimal Data Structures
inferredcites →https://doi.org/10.1137/0210056openalex-snapshot
Optimal Retrieval Algorithms for Small Region Queries
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/322276.322281openalex-snapshot
A Lower Bound on the Complexity of Orthogonal Range Queries
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/358656.358681openalex-snapshot
Plane-sweep algorithms for intersecting geometric figures
inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot
Multidimensional divide-and-conquer
inferredcites →https://doi.org/10.1145/800061.808755openalex-snapshot
A 3-space partition and its applications
inferredcites →https://doi.org/10.1184/r1/6591230openalex-snapshot
A Problem in Multivariate Statistics: Algorithm, Data Structure, and Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4687959openalex-extracted
Strategies for Low-Stakes Decision Making in Online Contexts: A Typology Based on Time Commitment and Domain Knowledge
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_94openalex-snapshot
Lower bounds for dynamic range query problems that permit subtraction (extended abstract)
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-49257-7_29openalex-snapshot
The Data Warehouse of Newsgroups
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_79openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_96openalex-snapshot
Optimally managing the history of an evolving forest
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_86openalex-snapshot
On the difficulty of range searching
inferred← citeshttps://doi.org/10.1007/3-540-62222-5_61openalex-snapshot
Efficient indexing for constraint and temporal databases
inferred← citeshttps://doi.org/10.1007/978-1-4471-3033-8_13openalex-snapshot
Access Methods for Bi-Temporal Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_40openalex-snapshot
Methoden zur Visualisierung räumlicher geometrischer Daten
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_42openalex-snapshot
Ray Tracing Algorithms — Theory and Practice
inferred← citeshttps://doi.org/10.1007/bf01758847openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferred← citeshttps://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferred← citeshttps://doi.org/10.1007/bf02187898openalex-snapshot
Polygonizations of point sets in the plane
inferred← citeshttps://doi.org/10.1007/bfb0015733openalex-snapshot
Optimal solutions for a class of point retrieval problems
inferred← citeshttps://doi.org/10.1007/bfb0015734openalex-snapshot
Fractional cascading: A data structuring technique with geometric applications
inferred← citeshttps://doi.org/10.1007/bfb0024021openalex-snapshot
The volume of the union of many spheres and point inclusion problems
inferred← citeshttps://doi.org/10.1007/bfb0024024openalex-snapshot
Reduced memory space for multi-dimensional search trees (extended abstract)
inferred← citeshttps://doi.org/10.1007/s004539910021openalex-snapshot
Grasping and In-Hand Manipulation: Geometry and Algorithms
inferred← citeshttps://doi.org/10.1007/s10958-010-9973-2openalex-snapshot
Information storage and search complexity theory
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90054-7openalex-snapshot
Fast dynamic intersection searching in a set of isothetic line segments
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90027-6openalex-snapshot
Efficient uses of the past
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferred← citeshttps://doi.org/10.1016/0734-189x(84)90142-7openalex-snapshot
Some methods of computational geometry applied to computer graphics
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.04.005openalex-snapshot
GPU Parallel Visibility Algorithm for a Set of Segments Using Merge Path
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80040-6openalex-snapshot
Geometric retrieval problems
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot
New upper bounds for neighbor searching
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80028-6openalex-snapshot
Optimal solutions for a class of point retrieval problems
inferred← citeshttps://doi.org/10.1023/a:1018702924440openalex-snapshot
Supporting Temporal Views in a Management Information Base
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.1080/00207169208804136openalex-snapshot
A unified approach to geometric problems using dual cone transformation:
inferred← citeshttps://doi.org/10.1109/43.137520openalex-snapshot
An O(n log m) algorithm for VLSI design rule checking
inferred← citeshttps://doi.org/10.1109/iros.1997.649013openalex-snapshot
In-hand manipulation: geometry and algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1985.51openalex-snapshot
Slimming down search structures: A functional approach to algorithm design
inferred← citeshttps://doi.org/10.1109/sfcs.1986.29openalex-snapshot
Lower bounds on the complexity of multidimensional searching
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tc.1984.1676494openalex-snapshot
Computational Geometry on a Systolic Chip
inferred← citeshttps://doi.org/10.1109/tit.1985.1057060openalex-snapshot
On the convex layers of a planar set
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22472.xopenalex-snapshot
Planar Point Location Using Persistent Search Treesa
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/10515.10524openalex-snapshot
On the application of shared retrieval to orthogonal range queries
inferred← citeshttps://doi.org/10.1145/160985.161138openalex-snapshot
Dominance range-query: the one-reporting case
inferred← citeshttps://doi.org/10.1145/1960397.1960406openalex-snapshot
Grid-to-ports clock routing for high performance microprocessor designs
inferred← citeshttps://doi.org/10.1145/220279.220302openalex-snapshot
An optimal algorithm for finding segments intersections
inferred← citeshttps://doi.org/10.1145/22145.22164openalex-snapshot
Space-time tradeoffs for orthogonal range queries
inferred← citeshttps://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferred← citeshttps://doi.org/10.1145/41958.41986openalex-snapshot
A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
inferred← citeshttps://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferred← citeshttps://doi.org/10.1145/74382.74466openalex-snapshot
An O(nlogm) algorithm for VLSI design rule checking
inferred← citeshttps://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems
inferred← citeshttps://doi.org/10.1541/ieejeiss1987.116.2_275openalex-snapshot
An Inference of Measuring Escapability from Two-Dimensional Mazes by Network Model
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5018openalex-snapshot
Fast Parallel Algorithms on a Class of Graph Structures With Applications in Relational Databases and Computer Networks.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5277openalex-snapshot
Parallel and Distributed Algorithms for a Class of Graph-Related Computational Problems.
inferred← citeshttps://doi.org/10.4213/dm226openalex-snapshot
О функциональной сложности двумерной задачи интервального поиска
inferred← citeshttps://doi.org/10.48550/arxiv.1501.02309openalex-snapshot
Range Queries on Uncertain Data
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.