On the Worst-Case Behavior of String-Searching Algorithms

SIAM Journal on Computing - United States
doi 10.1137/0206048
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

The Relative Worst Order Ratio for On-Line Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Improved Algorithms for Edit Distance and LCS: Beyond Worst Case

2020English

An Algorithm for String Searching

International Journal of Computer Applications
2019English

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1974English

On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

String Searching Using External Memory

English

Chinese String Searching Using the KMP Algorithm

1996English

Continuant Polynomials and Worst-Case Behavior of Hopcroft’s Minimization Algorithm

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy