On the public citation graph

Optimal Retrieval Algorithms for Small Region Queries

https://doi.org/10.1137/0210056
0 signed · 33 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.1007/bf00263763openalex-snapshot
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
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.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1093/comjnl/18.3.265openalex-snapshot
Hashing functions
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1137/0205003openalex-snapshot
Partial-Match Retrieval Algorithms
inferredcites →https://doi.org/10.1145/320071.320074openalex-snapshot
Optimal partial-match retrieval when fields are independently specified
inferredcites →https://doi.org/10.1145/320613.320618openalex-snapshot
Quintary trees
inferredcites →https://doi.org/10.1145/322123.322126openalex-snapshot
Optimality Properties of Multiple-Key Hashing Functions
inferredcites →https://doi.org/10.1145/356789.356797openalex-snapshot
Data Structures for Range Searching
inferredcites →https://doi.org/10.1145/359461.359475openalex-snapshot
Approximating block accesses in database organizations
inferredcites →https://doi.org/10.1145/360827.360831openalex-snapshot
Attribute based file organization in a paged memory environment
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching

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-44503-x_23openalex-snapshot
Orthogonal Range Queries in OLAP
inferred← citeshttps://doi.org/10.1007/978-3-642-15576-5_51openalex-snapshot
Criteria for Reducibility of Moving Objects Closeness Problem
inferred← citeshttps://doi.org/10.1007/s10958-010-9973-2openalex-snapshot
Information storage and search complexity theory
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00741-7openalex-snapshot
Dynamic orthogonal range queries in OLAP
inferred← citeshttps://doi.org/10.1080/02533839.1987.9677033openalex-snapshot
Optimal Cartesian product files for orthogonal range queries
inferred← citeshttps://doi.org/10.1109/icde.1986.7266264openalex-snapshot
A locking scheme for associative retrieval
inferred← citeshttps://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892088openalex-snapshot
New data structures for orthogonal range searching
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/tse.1985.232197openalex-snapshot
On the File Design Problem for Partial Match Retrieval
inferred← citeshttps://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferred← citeshttps://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferred← citeshttps://doi.org/10.1145/1007912.1007920openalex-snapshot
Consistent and compact data management in distributed storage systems
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/356924.356928openalex-snapshot
Query Optimization in Database Systems
inferred← citeshttps://doi.org/10.1145/3828.3839openalex-snapshot
Adding range restriction capability to dynamic data structures
inferred← citeshttps://doi.org/10.4213/dm1157openalex-snapshot
Критерий сводимости задачи об опасной близости к одномерному интервальному поиску
inferred← citeshttps://doi.org/10.4213/dm226openalex-snapshot
О функциональной сложности двумерной задачи интервального поиска
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.