RECURSIVE MATCHING ALGORITHMS AND LINEAR ORDERS ON SUBSET LATTICE

被引：10
|
作者：
WHITE, DE [1 ]
WILLIAMSON, SG [1 ]
机构：
[1] UNIV MINNESOTA,SCH MATH,MINNEAPOLIS,MN 55455
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES A | 1977年 / 23卷 / 02期
关键词：
D O I：
10.1016/0097-3165(77)90034-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：117 / 127
页数：11
相关论文
共 50 条
  • [1] RECURSIVE LINEAR ORDERS WITH RECURSIVE SUCCESSIVITIES
    MOSES, M
    ANNALS OF PURE AND APPLIED LOGIC, 1984, 27 (03) : 253 - 264
  • [2] LATTICE FORM RECURSIVE LINEAR LEAST-SQUARE ALGORITHMS
    WIBERG, DM
    BASKIN, F
    LINDSAY, RD
    MODELING IDENTIFICATION AND CONTROL, 1984, 5 (02) : 71 - 101
  • [3] Subset comparisons for additive linear orders
    Fishburn, PC
    Pekec, A
    Reeds, JA
    MATHEMATICS OF OPERATIONS RESEARCH, 2002, 27 (01) : 227 - 243
  • [4] Initial segments of recursive linear orders
    Ambos-Spies, K
    Cooper, SB
    Lempp, S
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1998, 14 (02): : 101 - 105
  • [5] Initial Segments of Recursive Linear Orders
    Ambos-Spies K.
    Cooper S.B.
    Lempp S.
    Order, 1997, 14 (2) : 101 - 105
  • [6] RELATIONS INTRINSICALLY RECURSIVE IN LINEAR ORDERS
    MOSES, M
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1986, 32 (05): : 467 - 472
  • [7] RECURSIVE LINEAR ORDERS WITH INCOMPLETE SUCCESSIVITIES
    DOWNEY, RG
    MOSES, MF
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1991, 326 (02) : 653 - 668
  • [8] Linear algebra with recursive algorithms
    Andersen, BS
    Gustavson, F
    Karaivanov, A
    Marinova, M
    Wasniewski, J
    Yalamov, P
    APPLIED PARALLEL COMPUTING, PROCEEDINGS: NEW PARADIGMS FOR HPC IN INDUSTRY AND ACADEMIA, 2001, 1947 : 38 - 51
  • [9] Tree pattern matching to subset matching in linear time
    Cole, R
    Hariharan, R
    SIAM JOURNAL ON COMPUTING, 2003, 32 (04) : 1056 - 1066
  • [10] Algorithms for Subset Selection in Linear Regression
    Das, Abhimanyu
    Kempe, David
    STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 45 - 54
12345