Optimal parallel algorithms for prefix matching

Ramesh Hariharan, Shanmugavelayutham Muthukrishnan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings
    EditorsEli Shamir, Serge Abiteboul
    PublisherSpringer-Verlag
    Pages203-214
    Number of pages12
    ISBN (Print)9783540582014
    StatePublished - Jan 1 1994
    EventProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94 - Jerusalem, Isr
    Duration: Jul 1 1994Jul 1 1994

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume820 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    OtherProceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94
    CityJerusalem, Isr
    Period7/1/947/1/94

    Fingerprint

    Prefix
    Optimal Algorithm
    Parallel algorithms
    Parallel Algorithms
    Matching Problem
    Polynomial
    Polynomials
    Character
    Text

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Hariharan, R., & Muthukrishnan, S. (1994). Optimal parallel algorithms for prefix matching. In E. Shamir, & S. Abiteboul (Eds.), Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings (pp. 203-214). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 820 LNCS). Springer-Verlag.

    Optimal parallel algorithms for prefix matching. / Hariharan, Ramesh; Muthukrishnan, Shanmugavelayutham.

    Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. ed. / Eli Shamir; Serge Abiteboul. Springer-Verlag, 1994. p. 203-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 820 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Hariharan, R & Muthukrishnan, S 1994, Optimal parallel algorithms for prefix matching. in E Shamir & S Abiteboul (eds), Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 820 LNCS, Springer-Verlag, pp. 203-214, Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94, Jerusalem, Isr, 7/1/94.
    Hariharan R, Muthukrishnan S. Optimal parallel algorithms for prefix matching. In Shamir E, Abiteboul S, editors, Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. Springer-Verlag. 1994. p. 203-214. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Hariharan, Ramesh ; Muthukrishnan, Shanmugavelayutham. / Optimal parallel algorithms for prefix matching. Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings. editor / Eli Shamir ; Serge Abiteboul. Springer-Verlag, 1994. pp. 203-214 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{f20aefb597464dbab06fee90a1f45047,
    title = "Optimal parallel algorithms for prefix matching",
    abstract = "The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.",
    author = "Ramesh Hariharan and Shanmugavelayutham Muthukrishnan",
    year = "1994",
    month = "1",
    day = "1",
    language = "English (US)",
    isbn = "9783540582014",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "203--214",
    editor = "Eli Shamir and Serge Abiteboul",
    booktitle = "Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings",

    }

    TY - GEN

    T1 - Optimal parallel algorithms for prefix matching

    AU - Hariharan, Ramesh

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 1994/1/1

    Y1 - 1994/1/1

    N2 - The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

    AB - The Prefix Matching Problem is to determine, for each location in the text t, the longest prefix of a given pattern p which occurs beginning at that location. We present two work-optimal parallel algorithms for this problem. The first algorithm works for the case when the characters in p and t are drawn from an alphabet set of size polynomial in m + n, where m = |p| and n = |t|; it takes O(log m) time, O(m1+ε+n1+ε) space, and does O(m + n) work, for any ε>0. The second algorithm works for unbounded alphabet sets and takes O(log2m(log log m)3) time, O(m + n) space, and does O(m + n) work. These are the first known work-optimal algorithms for this problem.

    UR - http://www.scopus.com/inward/record.url?scp=21344498092&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=21344498092&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:21344498092

    SN - 9783540582014

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 203

    EP - 214

    BT - Automata, Languages and Programming - 21st International Colloquium, ICALP 1994, Proceedings

    A2 - Shamir, Eli

    A2 - Abiteboul, Serge

    PB - Springer-Verlag

    ER -