Concepedia

Complexity Of String Algorithms

Complexity of String Algorithms is a theoretical construct in computer science that characterizes the computational resources required by algorithms designed to process, analyze, or manipulate strings, distinguished by its focus on asymptotic bounds associated with pattern matching, substring search, and text indexing operations.

585

Publications

43.6K

Citations

834

Authors

417

Institutions

Publications per year

2017–2026

62

Parents

Publications

585

The String-to-String Correction Problem

Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974 · 3.1K citations · Full text

, , +9

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Vaughan Pratt · SIAM Journal on Computing · 1977 · 2.9K citations

, , +12

Efficient string matching

Alfred V. Aho, Margaret J. Corasick · Communications of the ACM · 1975 · 2.9K citations · Full text

, , +13

Suffix Arrays: A New Method for On-Line String Searches

Udi Manber, Gene Myers · SIAM Journal on Computing · 1993 · 2K citations

, , +11

Algorithms on strings, trees, and sequences

Dan Gusfield · 1997 · 1.7K citations

, , +5

1–5 of 585

Authors

834

  1. WR
    Wojciech Rytter

    University of Warsaw, Poland

    15 publications · 423 citations

    14

    h-index

  2. HB
    Hideo Bannai

    Kyushu University, Japan

    16 publications · 385 citations

    13

    h-index

  3. ZG
    Zvi Galil

    Tel Aviv University, Israel

    14 publications · 814 citations

    13

    h-index

  4. SI
    Shunsuke Inenaga

    Kyushu University, Japan

    16 publications · 347 citations

    13

    h-index

  5. CS
    Costas S. Iliopoulos

    King's College London, United Kingdom

    18 publications · 357 citations

    13

    h-index

1–5 of 834

Institutions

417

  1. University of Warsaw

    Warsaw, Poland

    17 h-index

    40 publications

    917 citations

  2. King's College London

    London, United Kingdom

    15 h-index

    42 publications

    869 citations

  3. Kyushu University

    Fukuoka, Japan

    15 h-index

    52 publications

    1.5K citations

  4. Bar-Ilan University

    Ramat Gan, Israel

    14 h-index

    36 publications

    1.8K citations

  5. Purdue University West Lafayette

    West Lafayette, United States

    14 h-index

    22 publications

    1.2K citations

  6. McMaster University

    Hamilton, Canada

    13 h-index

    14 publications

    404 citations

  7. University of Helsinki

    Helsinki, Finland

    13 h-index

    28 publications

    1.1K citations

  8. University of Waterloo

    Waterloo, Canada

    13 h-index

    17 publications

    896 citations

1–8 of 417

Venues

  1. SIAM Journal on Computing

    42 publications · 8K citations

    32

    h-index

  2. Information Processing Letters

    30 publications · 1K citations

    19

    h-index

  3. Theoretical Computer Science

    42 publications · 1.5K citations

    19

    h-index

  4. Algorithmica

    22 publications · 898 citations

    17

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 24 publications · 394 citations

    15

    h-index

1–5