Matching nuts and bolts in O(n log n) time

被引：0
|
作者：
Komlos, J [1 ]
Ma, Y [1 ]
Szemeredi, E [1 ]
机构：
[1] RUTGERS STATE UNIV,DEPT MATH,PISCATAWAY,NJ 08855
来源：
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1996年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：232 / 241
页数：10
相关论文
共 50 条
  • [21] Point location in o(log n) time, Voronoi diagrams in o(n log n) time, and other transdichotomous results in computational geometry
    Chan, Timothy M.
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 333 - 342
  • [22] Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time
    Huang, Shang-En
    Huang, Dawei
    Kopelowitz, Tsvi
    Pettie, Seth
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 510 - 520
  • [23] COMPUTING MINIMAL TRIANGULATIONS IN TIME O(nα log n) = o(n2.376)
    Heggernes, Pinar
    Telle, Jan Arne
    Villanger, Yngve
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (04) : 900 - 913
  • [24] Computing Minimal Triangulations in Time O(nα log n) = o(n2.376)
    Heggernes, Pinar
    Telle, Jan Arne
    Villanger, Yngve
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 907 - 916
  • [25] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [26] Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
    Buss, SR
    Yianilos, PN
    SIAM JOURNAL ON COMPUTING, 1998, 27 (01) : 170 - 201
  • [27] AN O(N-LOG LOG-N)-TIME ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON
    TARJAN, RE
    VANWYK, CJ
    SIAM JOURNAL ON COMPUTING, 1988, 17 (01) : 143 - 178
  • [28] Solving the string statistics problem in time O(n log n)
    Brodal, GS
    Lyngso, RB
    Östlin, A
    Pedersen, CNS
    AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 728 - 739
  • [29] Sorting Signed Permutations by Inversions in O(n log n) Time
    Swenson, Krister M.
    Rajan, Vaibhav
    Lin, Yu
    Moret, Bernard M. E.
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2009, 5541 : 386 - +
  • [30] Finding neighbours on bincode-based images in O(n log log n) time
    Chung, KL
    Huang, CY
    PATTERN RECOGNITION LETTERS, 1996, 17 (10) : 1117 - 1124
12345