Tree pattern matching and subset matching in deterministic O(nlog3n)-time

被引：0
|
作者：
Cole, R [1 ]
Hariharan, R [1 ]
Indyk, P [1 ]
机构：
[1] NYU, Courant Inst, New York, NY 10012 USA
来源：
PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1999年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The main goal of this paper is to give an O(n log(3) n) time deterministic algorithm for the the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log(3) n/log log n) time randomized algorithm for these problems. Finally we give a O(n log n(z + log n)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length z.
引用
收藏
页码：245 / 254
页数：10
相关论文
共 50 条
  • [1] Tree pattern matching to subset matching in linear time
    Cole, R
    Hariharan, R
    SIAM JOURNAL ON COMPUTING, 2003, 32 (04) : 1056 - 1066
  • [2] Deterministic Dynamic Matching in O(1) Update Time
    Bhattacharya, Sayan
    Chakrabarty, Deeparnab
    Henzinger, Monika
    ALGORITHMICA, 2020, 82 (04) : 1057 - 1080
  • [3] Deterministic Dynamic Matching in O(1) Update Time
    Sayan Bhattacharya
    Deeparnab Chakrabarty
    Monika Henzinger
    Algorithmica, 2020, 82 : 1057 - 1080
  • [4] A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
    Antoniadis, Antonios
    Barcelo, Neal
    Nugent, Michael
    Pruhs, Kirk
    Scquizzato, Michele
    ALGORITHMICA, 2019, 81 (07) : 2917 - 2933
  • [5] A o(n)-Competitive Deterministic Algorithm for Online Matching on a Line
    Antoniadis, Antonios
    Barcelo, Neal
    Nugent, Michael
    Pruhs, Kirk
    Scquizzato, Michele
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 11 - 22
  • [6] Deterministic superimposed coding with applications to pattern matching
    Indyk, P
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 127 - 136
  • [7] On the algorithm of Berztiss for tree pattern matching
    Valiente, G
    PROCEEDINGS OF THE FIFTH MEXICAN INTERNATIONAL CONFERENCE IN COMPUTER SCIENCE (ENC 2004), 2004, : 43 - 49
  • [8] PARALLEL TREE PATTERN-MATCHING
    RAMESH, R
    RAMAKRISHNAN, IV
    JOURNAL OF SYMBOLIC COMPUTATION, 1990, 9 (04) : 485 - 501
  • [9] FASTER TREE PATTERN-MATCHING
    DUBINER, M
    GALIL, Z
    MAGEN, E
    JOURNAL OF THE ACM, 1994, 41 (02) : 205 - 213
  • [10] Approximate Cartesian Tree Pattern Matching
    Kim, Sungmin
    Han, Yo-Sub
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2024, 2024, 14791 : 189 - 202
12345