On the public citation graph
AnO(n logn) algorithm for the all-nearest-neighbors Problem
0 signed · 214 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/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1016/0020-0190(75)90044-7openalex-snapshot
Finding near neighbours in K-dimensional space
inferredcites →https://doi.org/10.1016/0020-0190(76)90064-8openalex-snapshot
Finding nearest neighbours
inferredcites →https://doi.org/10.1016/0020-0190(77)90070-9openalex-snapshot
The complexity of finding fixed-radius near neighbors
inferredcites →https://doi.org/10.1109/sfcs.1983.16openalex-snapshot
Fast algorithms for the all nearest neighbors problem
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
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.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/hbm.20397openalex-snapshot
Functional connectivity mapping using the ferromagnetic Potts spin model
inferred← citeshttps://doi.org/10.1002/sta4.87openalex-snapshot
Accelerated non‐parametrics for cascades of Poisson processes
inferred← citeshttps://doi.org/10.1002/wcms.1691openalex-snapshot
The kth nearest neighbor method for estimation of entropy changes from molecular ensembles
inferred← citeshttps://doi.org/10.1006/inco.1995.1049openalex-snapshot
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
inferred← citeshttps://doi.org/10.1006/jagm.1996.0028openalex-snapshot
Selection in Monotone Matrices and Computingkth Nearest Neighbors
inferred← citeshttps://doi.org/10.1006/jagm.1996.0839openalex-snapshot
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
inferred← citeshttps://doi.org/10.1007/11430919_84openalex-snapshot
PatZip: Pattern-Preserved Spatial Data Compression
inferred← citeshttps://doi.org/10.1007/11589440_7openalex-snapshot
Farthest-Point Queries with Geometric and Combinatorial Constraints
inferred← citeshttps://doi.org/10.1007/11764298_8openalex-snapshot
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
inferred← citeshttps://doi.org/10.1007/11844297_56openalex-snapshot
A Fast and Effective Method for Pruning of Non-dominated Solutions in Many-Objective Problems
inferred← citeshttps://doi.org/10.1007/11881223_56openalex-snapshot
Studies on Neighbourhood Graphs for Communication in Multi Agent Systems
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_18openalex-snapshot
Computing Farthest Neighbors on a Convex Polytope
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_31openalex-snapshot
Efficient Expected-Case Algorithms for Planar Point Location
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-54945-5_80openalex-snapshot
Rectangular point location and the dynamic closest pair problem
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_240openalex-snapshot
A dynamic separator algorithm
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_261openalex-snapshot
A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_2openalex-snapshot
Selection in monotone matrices and computing k th nearest neighbors
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_1openalex-snapshot
Introduction to geometric computing: From algorithms to software
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_15openalex-snapshot
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-12598-1_28openalex-snapshot
Diversity-Indicator Based Multi-Objective Evolutionary Algorithm: DI-MOEA
inferred← citeshttps://doi.org/10.1007/978-3-030-36412-0_29openalex-snapshot
A True $$O(n\log {n})$$ Algorithm for the All-k-Nearest-Neighbors Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-55182-6openalex-snapshot
Foundations of Vector Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_6openalex-snapshot
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_18openalex-snapshot
On Some Proximity Problems of Colored Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-07176-3_68openalex-snapshot
DenClust: A Density Based Seed Selection Approach for K-Means
inferred← citeshttps://doi.org/10.1007/978-3-319-08254-7_1openalex-snapshot
Nearest Neighbor Queries on Big Data
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_9openalex-snapshot
Functional Pearl: Nearest Shelters in Manhattan
inferred← citeshttps://doi.org/10.1007/978-3-319-18356-5_21openalex-snapshot
A Density-Penalized Distance Measure for Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-19315-1_27openalex-snapshot
Kinetic Reverse k-Nearest Neighbor Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-91452-7_15openalex-snapshot
Finding All Nearest Neighbors with a Single Graph Traversal
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_19openalex-snapshot
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_10openalex-snapshot
Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
inferred← citeshttps://doi.org/10.1007/978-3-642-40852-6_13openalex-snapshot
Network Aware Resource Allocation Scheme for Mobile Ad Hoc Computational Grid
inferred← citeshttps://doi.org/10.1007/978-3-642-40991-2_42openalex-snapshot
Fast kNN Graph Construction with Locality Sensitive Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-54474-3_2openalex-snapshot
Efficient Estimation of Information Transfer
inferred← citeshttps://doi.org/10.1007/978-981-13-1513-8_16openalex-snapshot
DataSpeak: Data Extraction, Aggregation, and Classification Using Big Data Novel Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-33-6632-9_8openalex-snapshot
Comparison of the Shape of Digital Models of Pump Components
inferred← citeshttps://doi.org/10.1007/bf01178779openalex-snapshot
An all-round sweep algorithm for 2-dimensional nearest-neighbor problems
inferred← citeshttps://doi.org/10.1007/bf01377181openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
inferred← citeshttps://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.1007/bf02574005openalex-snapshot
Approximating Euclidean distances by small degree graphs
inferred← citeshttps://doi.org/10.1007/bf02574012openalex-snapshot
Iterated nearest neighbors and finding minimal polytopes
inferred← citeshttps://doi.org/10.1007/bf02574695openalex-snapshot
A sparse graph almost as good as the complete graph on points inK dimensions
inferred← citeshttps://doi.org/10.1007/bfb0028254openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1007/bfb0028255openalex-snapshot
Shallow interdistance selection and interdistance enumeration
inferred← citeshttps://doi.org/10.1007/pl00009449openalex-snapshot
Nearest Neighbor Queries in Metric Spaces
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.1007/s004530010047openalex-snapshot
Linear Size Binary Space Partitions for Uncluttered Scenes
inferred← citeshttps://doi.org/10.1007/s00454-009-9137-7openalex-snapshot
Region-Fault Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1007/s00521-009-0266-yopenalex-snapshot
A comparative evaluation of nonlinear dynamics methods for time series prediction
inferred← citeshttps://doi.org/10.1007/s00778-024-00864-xopenalex-snapshot
Survey of vector database management systems
inferred← citeshttps://doi.org/10.1007/s10044-011-0224-zopenalex-snapshot
Relational space classification for malaria diagnosis
inferred← citeshttps://doi.org/10.1007/s10103-019-02945-8openalex-snapshot
Automatization analysis of the extremely sensitive laser-based dual-mode biomedical sensor
inferred← citeshttps://doi.org/10.1007/s10115-013-0720-0openalex-snapshot
Analysis and evaluation of the top- $$k$$ k most influential location selection query
inferred← citeshttps://doi.org/10.1007/s10115-023-02038-7openalex-snapshot
A dynamic density-based clustering method based on K-nearest neighbor
inferred← citeshttps://doi.org/10.1007/s10707-026-00591-1openalex-snapshot
K Nearest neighbor join algorithms for spatial data using compact and plain data structures in main memory
inferred← citeshttps://doi.org/10.1007/s10723-011-9188-xopenalex-snapshot
An Energy-Efficient Resource Allocation Scheme for Mobile Ad Hoc Computational Grids
inferred← citeshttps://doi.org/10.1007/s10915-022-01894-9openalex-snapshot
Boundary Estimation from Point Clouds: Algorithms, Guarantees and Applications
inferred← citeshttps://doi.org/10.1007/s11390-014-1475-0openalex-snapshot
On Some Proximity Problems of Colored Sets
inferred← citeshttps://doi.org/10.1007/s12065-013-0103-1openalex-snapshot
On evolutionary subspace clustering with symbiosis
inferred← citeshttps://doi.org/10.1007/s41781-024-00117-0openalex-snapshot
Real-Time Graph Building on FPGAs for Machine Learning Trigger Applications in Particle Physics
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90222-uopenalex-snapshot
Approximate closest-point queries in high dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90001-9openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00009-7openalex-snapshot
Algorithms for proximity problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
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.acha.2007.07.001openalex-snapshot
Diffusion polynomial frames on metric measure spaces
inferred← citeshttps://doi.org/10.1016/j.apnum.2022.03.015openalex-snapshot
An approach to adaptive refinement for the RBF-FD method for 2D elliptic equations
inferred← citeshttps://doi.org/10.1016/j.cag.2006.11.011openalex-snapshot
A fast all nearest neighbor algorithm for applications involving large point-clouds
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.07.002openalex-snapshot
Farthest-point queries with geometric and combinatorial constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.12.002openalex-snapshot
Efficient approximation algorithms for clustering point-sets
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.11.001openalex-snapshot
Kinetic k-Semi-Yao graph and its applications
inferred← citeshttps://doi.org/10.1016/j.compfluid.2020.104633openalex-snapshot
An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations
inferred← citeshttps://doi.org/10.1016/j.cpc.2018.09.010openalex-snapshot
Automatic trajectory recognition in Active Target Time Projection Chambers data by means of hierarchical clustering
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.04.165openalex-snapshot
Gene selection and classification using Taguchi chaotic binary particle swarm optimization
inferred← citeshttps://doi.org/10.1016/j.ins.2019.06.007openalex-snapshot
Geometric SMOTE a geometrically enhanced drop-in replacement for SMOTE
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.06.021openalex-snapshot
Minimizing interference in ad hoc networks with bounded communication radius
inferred← citeshttps://doi.org/10.1016/j.is.2015.11.004openalex-snapshot
Crowdsourcing emergency data in non-operational cellular networks
inferred← citeshttps://doi.org/10.1016/j.is.2017.07.001openalex-snapshot
Privacy preserving record linkage in the presence of missing values
inferred← citeshttps://doi.org/10.1016/j.jcp.2020.109427openalex-snapshot
Multidimensional phase recovery and interpolative decomposition butterfly factorization
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.017openalex-snapshot
A taxonomy for nearest neighbour queries in spatial databases
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114726openalex-snapshot
A saddle point-guided clustering algorithm for data with complex structure
inferred← citeshttps://doi.org/10.1016/j.optlaseng.2016.09.006openalex-snapshot
Temporal phase unwrapping using orthographic projection
inferred← citeshttps://doi.org/10.1016/j.patcog.2009.09.012openalex-snapshot
Attributed relational graph matching based on the nested assignment structure
inferred← citeshttps://doi.org/10.1016/j.patrec.2010.07.001openalex-snapshot
Push–Pull marginal discriminant analysis for feature extraction
inferred← citeshttps://doi.org/10.1016/j.peva.2021.102219openalex-snapshot
THAAD: Efficient matching queries under temporal abstraction for anomaly detection
inferred← citeshttps://doi.org/10.1016/j.sigpro.2011.11.027openalex-snapshot
Approximate all nearest neighbor search for high dimensional entropy estimation for image registration
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00431-0openalex-snapshot
Computing farthest neighbors on a convex polytope
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00334-xopenalex-snapshot
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00013-4openalex-snapshot
Extending range queries and nearest neighbors
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.1016/s0925-7721(00)00022-5openalex-snapshot
Approximate range searching☆☆A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp. 172–181.
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1063/1.5080943openalex-snapshot
A fast approximation for adaptive wavelength selection for tunable infrared chemical sensors
inferred← citeshttps://doi.org/10.1073/pnas.1510504113openalex-snapshot
Improving massive experiments with threshold blocking
inferred← citeshttps://doi.org/10.1080/00401706.2018.1437476openalex-snapshot
Permutation and Grouping Methods for Sharpening Gaussian Process Approximations
inferred← citeshttps://doi.org/10.1080/17445760.2015.1057820openalex-snapshot
Decomposable algorithm for computingk-nearest neighbours across partitioned data
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq067openalex-snapshot
Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing
inferred← citeshttps://doi.org/10.1093/biomet/asz024openalex-snapshot
Nonparametric independence testing via mutual information
inferred← citeshttps://doi.org/10.1093/mnras/stad141openalex-snapshot
Automated classification of eclipsing binary systems in the VVV Survey
inferred← citeshttps://doi.org/10.1101/2020.09.13.295089openalex-snapshot
nanoDoc: RNA modification detection using Nanopore raw reads with Deep One-Class Classification
inferred← citeshttps://doi.org/10.1103/physrevresearch.1.033061openalex-snapshot
Fast algorithm for topologically disordered lattices with constant coordination number
inferred← citeshttps://doi.org/10.1109/5.163414openalex-snapshot
Relative neighborhood graphs and their relatives
inferred← citeshttps://doi.org/10.1109/7.953245openalex-snapshot
Fast data association using multidimensional assignment with clustering
inferred← citeshttps://doi.org/10.1109/cvpr.2012.6247790openalex-snapshot
Scalable k-NN graph construction for visual descriptors
inferred← citeshttps://doi.org/10.1109/cvpr46437.2021.01567openalex-snapshot
A Dual Iterative Refinement Method for Non-rigid Shape Matching
inferred← citeshttps://doi.org/10.1109/devlrn.2010.5578854openalex-snapshot
Discovering sensor space: Constructing spatial embeddings that explain sensor correlations
inferred← citeshttps://doi.org/10.1109/focs.2006.65openalex-snapshot
Ramsey partitions and proximity data structures
inferred← citeshttps://doi.org/10.1109/hipc.1997.634483openalex-snapshot
An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions
inferred← citeshttps://doi.org/10.1109/hpcc.2014.73openalex-snapshot
Network Aware and Power-Based Resource Allocation in Mobile Ad Hoc Computational Grid
inferred← citeshttps://doi.org/10.1109/icassp.2016.7472879openalex-snapshot
Information theoretic multivariate change detection for multisensory information processing in Internet of Things
inferred← citeshttps://doi.org/10.1109/icde.2015.7113326openalex-snapshot
Nearest neighborhood search in spatial databases
inferred← citeshttps://doi.org/10.1109/icde.2019.00117openalex-snapshot
Identifying the Most Interactive Object in Spatial Databases
inferred← citeshttps://doi.org/10.1109/icmla.2008.8openalex-snapshot
New Insights into Learning Algorithms and Datasets
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00032openalex-snapshot
GPU-Accelerated Approximate Nearest Neighbor Search via PCA-Augmented Graph Indexing for Vector Databases
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.135openalex-snapshot
Time-Power Tradeoffs for Sorting on a Mesh-Connected Computer with Optical Connections
inferred← citeshttps://doi.org/10.1109/isit.2017.8006659openalex-snapshot
Direct estimation of information divergence using nearest neighbor ratios
inferred← citeshttps://doi.org/10.1109/mdm.2012.19openalex-snapshot
Continuous All k-Nearest-Neighbor Querying in Smartphone Networks
inferred← citeshttps://doi.org/10.1109/mdm.2015.51openalex-snapshot
Rayzit: An Anonymous and Dynamic Crowd Messaging Architecture
inferred← citeshttps://doi.org/10.1109/rt.2006.280216openalex-snapshot
On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)
inferred← citeshttps://doi.org/10.1109/sai.2016.7556094openalex-snapshot
Mobile web application with shortest path finder
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492663openalex-snapshot
The bit vector intersection problem
inferred← citeshttps://doi.org/10.1109/sisap.2009.33openalex-snapshot
Approximate Direct and Reverse Nearest Neighbor Queries, and the k-nearest Neighbor Graph
inferred← citeshttps://doi.org/10.1109/sisy.2018.8524662openalex-snapshot
Community Detection Based Clustering
inferred← citeshttps://doi.org/10.1109/slt.2016.7846261openalex-snapshot
End-to-End attention based text-dependent speaker verification
inferred← citeshttps://doi.org/10.1109/tkde.2015.2503768openalex-snapshot
Distributed In-Memory Processing of All k Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2809623openalex-snapshot
Efficient Cluster-Based Boosting for Semisupervised Classification
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2830700openalex-snapshot
Feature Selection Based on the Neighborhood Entropy
inferred← citeshttps://doi.org/10.1109/tvcg.2010.9openalex-snapshot
Fast construction of k-nearest neighbor graphs for point clouds
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2869149openalex-snapshot
PANENE: A Progressive Algorithm for Indexing and Querying Approximate k-Nearest Neighbors
inferred← citeshttps://doi.org/10.1109/wacv61042.2026.00458openalex-snapshot
A Dataset and Framework for Learning State-invariant Object Representations
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2004.00791.xopenalex-snapshot
Balancing Considered Harmful — Faster Photon Mapping using the Voxel Volume Heuristic —
inferred← citeshttps://doi.org/10.1137/0218079openalex-snapshot
Solution of a Divide-and-Conquer Maximin Recurrence
inferred← citeshttps://doi.org/10.1137/s0097539704446281openalex-snapshot
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539793259458openalex-snapshot
New Techniques for Exact and Approximate Dynamic Closest-Point Problems
inferred← citeshttps://doi.org/10.1137/s0895480192232862openalex-snapshot
Multidimensional Divide-and-Conquer Maximin Recurrences
inferred← citeshttps://doi.org/10.1142/s0218195901000511openalex-snapshot
ON ENUMERATING AND SELECTING DISTANCES
inferred← citeshttps://doi.org/10.1142/s0218195911003603openalex-snapshot
REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION
inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
inferred← citeshttps://doi.org/10.1142/s0218195919400028openalex-snapshot
Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces
inferred← citeshttps://doi.org/10.1142/s0218195999000194openalex-snapshot
MIXED SPANNING TREES IN THEORY AND PRACTICE
inferred← citeshttps://doi.org/10.1145/1064092.1064117openalex-snapshot
Fast construction of nets in low dimensional metrics, and their applications
inferred← citeshttps://doi.org/10.1145/109648.109677openalex-snapshot
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
inferred← citeshttps://doi.org/10.1145/1183471.1183506openalex-snapshot
Distance join queries on spatial networks
inferred← citeshttps://doi.org/10.1145/140901.141934openalex-snapshot
Separator based parallel divide and conquer in computational geometry
inferred← citeshttps://doi.org/10.1145/142675.142740openalex-snapshot
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
inferred← citeshttps://doi.org/10.1145/142675.142742openalex-snapshot
An optimal algorithm for the on-line closest-pair problem
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/160985.161005openalex-snapshot
A deterministic linear time algorithm for geometric separators and its applications
inferred← citeshttps://doi.org/10.1145/177424.177621openalex-snapshot
New techniques for exact and approximate dynamic closest-point problems
inferred← citeshttps://doi.org/10.1145/1869790.1869796openalex-snapshot
Privacy-preserving data-oblivious geometric algorithms for geographic data
inferred← citeshttps://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferred← citeshttps://doi.org/10.1145/220279.220296openalex-snapshot
An optimal algorithm for closest pair maintenance (extended abstract)
inferred← citeshttps://doi.org/10.1145/2462356.2462378openalex-snapshot
Kinetic data structures for all nearest neighbors and closest pair in the plane
inferred← citeshttps://doi.org/10.1145/258533.258655openalex-snapshot
Nearest neighbor queries in metric spaces
inferred← citeshttps://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferred← citeshttps://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferred← citeshttps://doi.org/10.1145/276884.276916openalex-snapshot
On enumerating and selecting distances
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/2996913.2996995openalex-snapshot
Mining city-wide encounters in real-time
inferred← citeshttps://doi.org/10.1145/3183713.3196922openalex-snapshot
Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space
inferred← citeshttps://doi.org/10.1145/331532.331556openalex-snapshot
A unifying data structure for hierarchical methods
inferred← citeshttps://doi.org/10.1145/336154.336189openalex-snapshot
The analysis of a simple k -means clustering algorithm
inferred← citeshttps://doi.org/10.1145/3580305.3599327openalex-snapshot
Efficient Distributed Approximate k-Nearest Neighbor Graph Construction by Multiway Random Division Forest
inferred← citeshttps://doi.org/10.1145/3626246.3654691openalex-snapshot
Vector Database Management Techniques and Systems
inferred← citeshttps://doi.org/10.1145/3639294openalex-snapshot
Worst-Case-Optimal Similarity Joins on Graph Databases
inferred← citeshttps://doi.org/10.1145/3652609openalex-snapshot
L-FNNG: Accelerating Large-Scale KNN Graph Construction on CPU-FPGA Heterogeneous Platform
inferred← citeshttps://doi.org/10.1145/378583.378662openalex-snapshot
A practical approach for computing the diameter of a point set
inferred← citeshttps://doi.org/10.1186/s12859-018-2453-2openalex-snapshot
A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen
inferred← citeshttps://doi.org/10.1371/journal.pone.0074113openalex-snapshot
Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters
inferred← citeshttps://doi.org/10.1371/journal.pone.0092409openalex-snapshot
Fast k-NNG Construction with GPU-Based Quick Multi-Select
inferred← citeshttps://doi.org/10.15803/ijnc.4.1_70openalex-snapshot
An Optimal Time-Power Tradeoff for Sorting on a Mesh-Connected Computer with On-Chip Optics
inferred← citeshttps://doi.org/10.2172/918344openalex-snapshot
Algorithmic support for commodity-based parallel computing systems.
inferred← citeshttps://doi.org/10.2312/vg/vg-pbg08/025-031openalex-snapshot
Parallel Construction of k-Nearest Neighbor Graphs for Point Clouds
inferred← citeshttps://doi.org/10.3233/fi-1995-2241openalex-snapshot
A DETERMINISTIC LINEAR TIME ALGORITHM FOR GEOMETRIC SEPARATORS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.3233/jifs-169701openalex-snapshot
ARSkNN: An efficient k-nearest neighbor classification technique using mass based similarity measure
inferred← citeshttps://doi.org/10.3390/biophysica2040031openalex-snapshot
Data Structures and Algorithms for k-th Nearest Neighbours Conformational Entropy Estimation
inferred← citeshttps://doi.org/10.3390/jcm13061826openalex-snapshot
A Novel Method for Determining Fibrin/Fibrinogen Degradation Products and Fibrinogen Threshold Criteria via Artificial Intelligence in Massive Hemorrhage during Delivery with Hematuria
inferred← citeshttps://doi.org/10.48550/arxiv.0804.3784openalex-snapshot
On the metric distortion of nearest-neighbour graphs on random point sets
inferred← citeshttps://doi.org/10.48550/arxiv.1307.7852openalex-snapshot
Scalable $k$-NN graph construction
inferred← citeshttps://doi.org/10.48550/arxiv.1709.05282openalex-snapshot
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity in Computational Geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08976openalex-snapshot
A class of multi-resolution approximations for large spatial datasets
inferred← citeshttps://doi.org/10.48550/arxiv.1905.13267openalex-snapshot
Learning Nearest Neighbor Graphs from Noisy Distance Samples
inferred← citeshttps://doi.org/10.48550/arxiv.1907.02907openalex-snapshot
Hybridized Threshold Clustering for Massive Data
inferred← citeshttps://doi.org/10.5555/127787.127796openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.5555/1283383.1283384openalex-snapshot
Region-fault tolerant geometric spanners
inferred← citeshttps://doi.org/10.5555/313559.313612openalex-snapshot
Iterated nearest neighbors and finding minimal polytypes
inferred← citeshttps://doi.org/10.5705/ss.202018.0285openalex-snapshot
A class of multi-resolution approximations for large spatial datasets
showing the first 200 of 202 · page through all 202
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.