On the public citation graph
Efficient Searching with Linear Constraints
0 signed · 76 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.1006/jagm.1993.1040openalex-snapshot
Intersection Queries in Curved Objects
inferredcites →https://doi.org/10.1006/jcss.1996.0043openalex-snapshot
Indexing for Data Models with Constraints and Classes
inferredcites →https://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferredcites →https://doi.org/10.1007/3-540-60313-1_151openalex-snapshot
External-memory algorithms for processing line segments in geographic information systems
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf01231602openalex-snapshot
An introduction to spatial database systems
inferredcites →https://doi.org/10.1007/bf02187685openalex-snapshot
Halfspace range search: An algorithmic application ofk-sets
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/pl00009348openalex-snapshot
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%
inferredcites →https://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferredcites →https://doi.org/10.1007/s007780050030openalex-snapshot
The hB $^\Pi$ -tree: a multi-attribute index supporting concurrency, recovery and node consolidation
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot
New upper bounds for neighbor searching
inferredcites →https://doi.org/10.1090/conm/223openalex-snapshot
Advances in Discrete and Computational Geometry
inferredcites →https://doi.org/10.1109/icde.1996.492090openalex-snapshot
Improving the performance of multi-dimensional access structures based on k-d-trees
inferredcites →https://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferredcites →https://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferredcites →https://doi.org/10.1137/0215019openalex-snapshot
Constructing Belts in Two-Dimensional Arrangements with Applications
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/130283.130316openalex-snapshot
A qualitative comparison study of data structures for large line segment databases
inferredcites →https://doi.org/10.1145/182591.182595openalex-snapshot
Path caching (extended abstract)
inferredcites →https://doi.org/10.1145/237814.237864openalex-snapshot
Efficient 3-D range searching in external memory
inferredcites →https://doi.org/10.1145/263661.263670openalex-snapshot
On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases (extended abstract)
inferredcites →https://doi.org/10.1145/263661.263689openalex-snapshot
Processing queries by linear constraints
inferredcites →https://doi.org/10.1145/275487.275506openalex-snapshot
Efficient searching with linear constraints
inferredcites →https://doi.org/10.1145/276884.276914openalex-snapshot
Randomized external-memory algorithms for some geometric problems
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/99935.99949openalex-snapshot
The hB-tree: a multiattribute indexing method with good guaranteed performance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470579398.ch8openalex-snapshot
Predictive Location Tracking in Cellular and in Ad Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/3-540-36389-0_6openalex-snapshot
An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_6openalex-snapshot
Time Responsive External Data Structures for Moving Points
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
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-540-45072-6_10openalex-snapshot
Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-75185-4_15openalex-snapshot
Indexing Mobile Objects on the Plane Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_47openalex-snapshot
Approximate Range Searching in External Memory
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-20152-3_27openalex-snapshot
Indexing for Vector Projections
inferred← citeshttps://doi.org/10.1007/s00453-009-9297-0openalex-snapshot
Approximate Range Searching in External Memory
inferred← citeshttps://doi.org/10.1007/s00454-011-9347-7openalex-snapshot
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space
inferred← citeshttps://doi.org/10.1007/s00778-023-00804-1openalex-snapshot
Quantifying the competitiveness of a dataset in relation to general preferences
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.003openalex-snapshot
A general approach for cache-oblivious range reporting and approximate range counting
inferred← citeshttps://doi.org/10.1016/j.datak.2008.06.009openalex-snapshot
A new approach on indexing mobile objects on the plane
inferred← citeshttps://doi.org/10.1016/j.ins.2004.07.007openalex-snapshot
Dynamic histograms for future spatiotemporal range predicates
inferred← citeshttps://doi.org/10.1016/j.jag.2021.102625openalex-snapshot
Executing convex polytope queries on nD point clouds
inferred← citeshttps://doi.org/10.1016/j.jss.2004.03.018openalex-snapshot
Adaptive index management for future location-based queries
inferred← citeshttps://doi.org/10.1016/j.jss.2015.03.068openalex-snapshot
SMaRT: A novel framework for addressing range queries over nonlinear trajectories
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00068openalex-snapshot
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions
inferred← citeshttps://doi.org/10.1142/s0218195913600054openalex-snapshot
IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS
inferred← citeshttps://doi.org/10.1145/1542362.1542412openalex-snapshot
Cache-oblivious range reporting with optimal queries requires superlinear space
inferred← citeshttps://doi.org/10.1145/1542362.1542413openalex-snapshot
A general approach for cache-oblivious range reporting and approximate range counting
inferred← citeshttps://doi.org/10.1145/1989284.1989291openalex-snapshot
FIFO indexes for decomposable problems
inferred← citeshttps://doi.org/10.1145/2213836.2213882openalex-snapshot
Processing a large number of continuous preference top- k queries
inferred← citeshttps://doi.org/10.1145/2261250.2261301openalex-snapshot
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
inferred← citeshttps://doi.org/10.1145/2902251.2902290openalex-snapshot
Efficient Top-k Indexing via General Reductions
inferred← citeshttps://doi.org/10.1145/3546074openalex-snapshot
Generic Techniques for Building Top- k Structures
inferred← citeshttps://doi.org/10.1145/504794.504795openalex-snapshot
Monotonic reductions, representative equivalence, and compilation of intractable problems
inferred← citeshttps://doi.org/10.14778/3291264.3291269openalex-snapshot
On obtaining stable rankings
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.4018/978-1-60566-026-4.ch301openalex-snapshot
Indexing Techniques for Spatiotemporal Databases
inferred← citeshttps://doi.org/10.59490/abe.2022.12.6536openalex-snapshot
nD-PointCloud Data Management
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.