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
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:232 / 241
页数:10
相关论文
共 50 条
  • [41] Tree Evaluation Is in Space O(log n• log log n)
    Cook, James
    Mertz, Ian
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1268 - 1278
  • [42] O(LOG LOG N)-TIME INTEGER GEOMETRY ON THE CRCW PRAM
    CHLEBUS, BS
    DIKS, K
    KOWALUK, M
    ALGORITHMICA, 1995, 14 (01) : 52 - 69
  • [43] O(log log n)-time integer geometry on the CRCW PRAM
    Algorithmica (New York), 1 (52):
  • [44] COMPUTING A MAXIMUM CARDINALITY MATCHING IN A BIPARTITE GRAPH IN TIME O(N1.5-SQUARE-ROOT-M/LOG N)
    ALT, H
    BLUM, N
    MEHLHORN, K
    PAUL, M
    INFORMATION PROCESSING LETTERS, 1991, 37 (04) : 237 - 240
  • [45] A O(log n) Signature-Based String Matching Algorithm
    Nofal, Samer
    PROCEEDINGS OF THE 2009 SIXTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, VOLS 1-3, 2009, : 828 - 830
  • [46] Min-Cuts and Shortest Cycles in Planar Graphs in O(n log log n) Time
    Lacki, Jakub
    Sankowski, Piotr
    ALGORITHMS - ESA 2011, 2011, 6942 : 155 - 166
  • [47] An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees
    Asano, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 503 - 510
  • [48] Bisimilarity Minimization in O(m log n) Time
    Valmari, Antti
    APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS, 2009, 5606 : 123 - 142
  • [49] RANKING ARBORESCENCES IN O(KM LOG N)TIME
    CAMERINI, PM
    FRATTA, L
    MAFFIOLI, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 4 (04) : 235 - 242
  • [50] An O(n log n)-time algorithm for the restriction scaffold assignment problem
    Colannino, Justin
    Damian, Mirela
    Hurtado, Ferran
    Iacono, John
    Meijer, Henk
    Ramaswami, Suneeta
    Toussaint, Godfried
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2006, 13 (04) : 979 - 989