Squares, cubes, and time-space efficient string searching

被引：0
|
作者：
Crochemore, M.
Rytter, W.
机构：
来源：
Algorithmica (New York) | 1995年 / 13卷 / 05期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] SQUARES, CUBES, AND TIME-SPACE EFFICIENT STRING SEARCHING
    CROCHEMORE, M
    RYTTER, W
    ALGORITHMICA, 1995, 13 (05) : 405 - 425
  • [2] A time and space efficient data structure for string searching on large texts
    Dipto. di Matemat. Pura ed Applicata, Università di Padova, Via Belzoni 7, I-35131 Padova, Italy
    Inf. Process. Lett., 5 (217-222):
  • [3] A time and space efficient data structure for string searching on large texts
    Colussi, L
    DeCol, A
    INFORMATION PROCESSING LETTERS, 1996, 58 (05) : 217 - 222
  • [4] THE ZOOMING METHOD - A RECURSIVE APPROACH TO TIME-SPACE EFFICIENT STRING-MATCHING
    GASIENEC, L
    PLANDOWSKI, W
    RYTTER, W
    THEORETICAL COMPUTER SCIENCE, 1995, 147 (1-2) : 19 - 30
  • [5] Time-space formulation of a conservative string subject to finite transformations
    Roze, David
    Helie, Thomas
    Rouhaud, Emmanuelle
    IFAC PAPERSONLINE, 2024, 58 (06): : 232 - 237
  • [6] Influence Maximization: A Time-Space Efficient Algorithm
    Xia, Ganming
    2019 THE 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, CONTROL AND ROBOTICS (EECR 2019), 2019, 533
  • [7] An efficient time-space numerical solver for global warming
    Saito, TS
    Wakashima, S
    35TH INTERSOCIETY ENERGY CONVERSION ENGINEERING CONFERENCE & EXHIBIT (IECEC), VOLS 1 AND 2, TECHNICAL PAPERS, 2000, : 1026 - 1031
  • [8] Time-space efficient regression testing for configurable systems
    Souto, Sabrina
    d'Amorim, Marcelo
    JOURNAL OF SYSTEMS AND SOFTWARE, 2018, 137 : 733 - 746
  • [9] RELATIVIZING TIME, SPACE, AND TIME-SPACE
    BOOK, RV
    WILSON, CB
    XU, MR
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 571 - 581
  • [10] Numerical Scheme for Solving Time-Space Vibration String Equation of Fractional Derivative
    Elsayed, Asmaa M.
    Orlov, Viktor N.
    MATHEMATICS, 2020, 8 (07)
12345