On the public citation graph
An Optimal Algorithm for Closest-Pair Maintenance
0 signed · 81 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/inco.1995.1001openalex-snapshot
Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem
inferredcites →https://doi.org/10.1006/jagm.1996.0835openalex-snapshot
A Data Structure for Dynamically Maintaining Rooted Trees
inferredcites →https://doi.org/10.1007/3-540-57273-2_47openalex-snapshot
Combine and conquer: A general technique for dynamic algorithms
inferredcites →https://doi.org/10.1007/3-540-60220-8_78openalex-snapshot
Topology B-trees and their applications
inferredcites →https://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferredcites →https://doi.org/10.1007/bfb0028255openalex-snapshot
Shallow interdistance selection and interdistance enumeration
inferredcites →https://doi.org/10.1007/pl00009340openalex-snapshot
An Optimal Algorithm for Closest-Pair Maintenance
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1109/sfcs.1986.8openalex-snapshot
An optimal algorithm for the all-nearest-neighbors problem
inferredcites →https://doi.org/10.1137/s0097539792224516openalex-snapshot
A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
inferredcites →https://doi.org/10.1137/s0097539794277718openalex-snapshot
Randomized Data Structures for the Dynamic Closest-Pair Problem
inferredcites →https://doi.org/10.1145/142675.142742openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferredcites →https://doi.org/10.1145/177424.177621openalex-snapshot
New techniques for exact and approximate dynamic closest-point problems
inferredcites →https://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.1145/800113.803652openalex-snapshot
Divide-and-conquer in multidimensional space
inferredcites →https://doi.org/10.1515/9780773591134-020openalex-snapshot
An optimal algorithm for dynamic post-office problem in R²₁ and related problems
inferredcites →https://doi.org/10.1515/9780773591134-044openalex-snapshot
Dynamic algorithms for approximate neighbor searching
inferredcites →https://doi.org/10.22028/d291-26452openalex-snapshot
Maintaining the minimal distance of a point set in less than linear time
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.5555/127787.127796openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferredcites →https://doi.org/10.5555/313559.313610openalex-snapshot
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
inferredcites →https://doi.org/10.5555/313559.313680openalex-snapshot
A data structure for dynamically maintaining rooted trees
inferredcites →https://doi.org/10.5555/313559.313784openalex-snapshot
Randomized data structures for the dynamic closest-pair problem
inferredcites →https://doi.org/10.5555/313651.313705openalex-snapshot
Algorithms for dynamic closest pair and n-body potential fields
inferredcites →https://doi.org/10.5555/314464.314652openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching
inferredcites →https://doi.org/10.5555/320176.320185openalex-snapshot
New techniques for some dynamic closest-point and farthest-point problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/pro.5560071205openalex-snapshot
Identification of kinetically hot residues in proteins
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_89openalex-snapshot
Dynamic Algorithms for Approximating Interdistances
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_5openalex-snapshot
Geometric Algorithms for Agglomerative Hierarchical Clustering
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_21openalex-snapshot
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_2openalex-snapshot
Dynamic Compressed Hyperoctrees with Application to the N-body Problem
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_26openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-36021-3_40openalex-snapshot
A New Algorithm for the Closest Pair of Points for Very Large Data Sets Using Exponent Bucketing and Windowing
inferred← citeshttps://doi.org/10.1007/978-3-540-78246-9_33openalex-snapshot
Applying the Q n Estimator Online
inferred← citeshttps://doi.org/10.1007/978-3-642-22619-9_2openalex-snapshot
A Computational-Geometry Approach to Digital Image Contour Extraction
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_236-2openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-981-19-5224-1_74openalex-snapshot
Optimized Closest Pair Computation with CPU-GPU Combined Model
inferred← citeshttps://doi.org/10.1007/s00453-004-1130-1openalex-snapshot
Geographic Quorum System Approximations
inferred← citeshttps://doi.org/10.1007/s00453-005-1197-3openalex-snapshot
I/O-Efficient Well-Separated Pair Decomposition and Applications
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.csda.2008.02.027openalex-snapshot
Online analysis of time series by the estimator
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.11.001openalex-snapshot
An optimal hierarchical clustering algorithm for gene expression data
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102424openalex-snapshot
Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00239-0openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00021-3openalex-snapshot
Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266.
inferred← citeshttps://doi.org/10.1093/nar/gkr349openalex-snapshot
ESPRIT-Tree: hierarchical clustering analysis of millions of 16S rRNA pyrosequences in quasilinear computational time
inferred← citeshttps://doi.org/10.1109/mdm.2017.25openalex-snapshot
Fairness versus Optimality in Ridesharing
inferred← citeshttps://doi.org/10.1134/s0001434624090232openalex-snapshot
Approximate Search for the $$k$$th Order Distance in a System of Unit Square Points
inferred← citeshttps://doi.org/10.1137/s0895480100378367openalex-snapshot
Practical Approximation Algorithms for Zero- and Bounded-Skew Trees
inferred← citeshttps://doi.org/10.1142/9789812773289_0003openalex-snapshot
Extreme Distances in Multicolored Point Sets
inferred← citeshttps://doi.org/10.1145/1183471.1183506openalex-snapshot
Distance join queries on spatial networks
inferred← citeshttps://doi.org/10.1145/1435375.1435379openalex-snapshot
Kinetic and dynamic data structures for closest pair and all nearest neighbors
inferred← citeshttps://doi.org/10.1145/1835804.1835941openalex-snapshot
Online discovery and maintenance of time series motifs
inferred← citeshttps://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferred← citeshttps://doi.org/10.1145/293347.293348openalex-snapshot
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
inferred← citeshttps://doi.org/10.1145/3375395.3387667openalex-snapshot
Efficient Indexes for Diverse Top-k Range Queries
inferred← citeshttps://doi.org/10.1145/3617326openalex-snapshot
Closest Pairs Search Over Data Stream
inferred← citeshttps://doi.org/10.1145/3717823.3718209openalex-snapshot
Dynamic Locality Sensitive Orderings in Doubling Metrics
inferred← citeshttps://doi.org/10.11606/d.45.2000.tde-20220712-115327openalex-snapshot
Problemas dinâmicos em geometria computacional
inferred← citeshttps://doi.org/10.17169/refubium-10104openalex-snapshot
Simple reconstruction of non-simple curves and approximating the median in streams with constant storage
inferred← citeshttps://doi.org/10.17169/refubium-22903openalex-snapshot
Simple reconstruction of non-simple curves
inferred← citeshttps://doi.org/10.2172/765323openalex-snapshot
Final report on OPTIMASS: optimizing mass storage organization and access for multi-dimensional scientific data
inferred← citeshttps://doi.org/10.23919/date.2019.8715285openalex-snapshot
Dim Sum: Light Clock Tree by Small Diameter Sum
inferred← citeshttps://doi.org/10.4213/mzm14205openalex-snapshot
Приближенный поиск $k$-го порядкового расстояния в системе точек единичного квадрата
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.51openalex-snapshot
Euclidean TSP, Motorcycle Graphs, and Other New Applications of Nearest-Neighbor Chains
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.60openalex-snapshot
A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem
inferred← citeshttps://doi.org/10.4230/lipics.tqc.2020.9openalex-snapshot
On the Quantum Complexity of Closest Pair and Related Problems
inferred← citeshttps://doi.org/10.5555/365411.365490openalex-snapshot
Practical approximation algorithms for zero- and bounded-skew trees
inferred← citeshttps://doi.org/10.5555/545381.545444openalex-snapshot
Closest-point problems simplified on the RAM
inferred← citeshttps://doi.org/10.5555/642160.642165openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot
Extreme Distances in Multicolored Point Sets
showing the first 51 of 52 · page through all 52
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.