AN O(N LOG N) ALGORITHM FOR THE ALL-NEAREST-NEIGHBORS PROBLEM

被引：143
|
作者：
VAIDYA, PM [1 ]
机构：
[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 1989年 / 4卷 / 02期
关键词：
D O I：
10.1007/BF02187718
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：101 / 115
页数：15
相关论文
共 50 条
  • [41] An O(log n log log n) space algorithm for undirected st-connectivity
    Trifonov, Vladimir
    SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
  • [42] An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions
    Graf, T
    Latha, NSJ
    Kamakoti, V
    Rangan, CP
    FOURTH INTERNATIONAL CONFERENCE ON HIGH-PERFORMANCE COMPUTING, PROCEEDINGS, 1997, : 132 - 136
  • [43] A note of an O(n3/log n) time algorithm for all pairs shortest paths
    Han, Yijie
    INFORMATION PROCESSING LETTERS, 2008, 105 (03) : 114 - 116
  • [44] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
  • [45] An O(M(n) log n) Algorithm for the Jacobi Symbol
    Brent, Richard P.
    Zimmermann, Paul
    ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
  • [46] AN O(N LOG N) SET REFINEMENT ALGORITHM WITH APPLICATIONS
    RAO, NSV
    SRIDHAR, R
    IYENGAR, SS
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 40 (3-4) : 129 - 138
  • [47] An O(n log n) algorithm for finding dissimilar strings
    Abbasi, S
    Sengupta, A
    INFORMATION PROCESSING LETTERS, 1997, 62 (03) : 135 - 139
  • [48] An O(log*n) approximation algorithm for the asymmetric p-center problem
    Panigrahy, R
    Vishwanathan, S
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 27 (02): : 259 - 268
  • [49] An O(log(*)n) approximation algorithm for the asymmetric p-center problem
    Vishwanathan, S
    PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 1 - 5
  • [50] An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem
    Laboratory for Computer Science, Massachusetts Inst. of Technology, Cambridge, MA 02139, United States
    不详
    J Algorithms, 2 (259-268):
12345