3 PARTITION REFINEMENT ALGORITHMS

被引：641
作者：
PAIGE, R
TARJAN, RE
机构：
[1] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10012
[2] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
来源：
SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 06期
关键词：
DOUBLE LEXICAL ORDERING - LEXICOGRAPHIC SORTING - PARTITION REFINEMENT ALGORITHMS - RELATIONAL COARSEST PARTITION - SORTED SETS;
D O I：
10.1137/0216062
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：973 / 989
页数：17
相关论文
共 19 条
  • [1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
  • [2] DESIGN AND ANALYSIS OF A DATA STRUCTURE FOR REPRESENTING SORTED LISTS
    BROWN, MR
    TARJAN, RE
    [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 594 - 614
  • [3] PARTITIONING A GRAPH IN O(/A/LOG2/V/)
    CARDON, A
    CROCHEMORE, M
    [J]. THEORETICAL COMPUTER SCIENCE, 1982, 19 (01) : 85 - 98
  • [4] VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEM
    DOWNEY, PJ
    SETHI, R
    TARJAN, RE
    [J]. JOURNAL OF THE ACM, 1980, 27 (04) : 758 - 771
  • [5] Gries D., 1973, Acta Informatica, V2, P97, DOI 10.1007/BF00264025
  • [6] GUIBAS LJ, 1978, 19TH P IEEE S F COMP, P18
  • [7] Hopcroft John, 1971, N LOG N ALGORITHM MI, P189, DOI DOI 10.1016/B978-0-12-417750-5.50022-1
  • [8] A NEW DATA STRUCTURE FOR REPRESENTING SORTED LISTS
    HUDDLESTON, S
    MEHLHORN, K
    [J]. ACTA INFORMATICA, 1982, 17 (02) : 157 - 184
  • [9] Kanellakis Paris C., 1983, P 2 ANN ACM S PRINCI, P228
  • [10] KIRKPATRICK D, 1984, THEOR COMPUT SCI, V28, P263, DOI 10.1016/0304-3975(83)90023-3
12