Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An analysis of the Karp-Rabin string matching algorithm

From MaRDI portal
Publication:911281
Jump to:navigation, search

DOI10.1016/0020-0190(90)90135-KzbMath0696.68057OpenAlexW1971581375MaRDI QIDQ911281

Gaston H. Gonnet, Ricardo A. Baeza-Yates

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90135-k


zbMATH Keywords

probabilistic algorithmsignaturesaverage case analysisstring searching


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)


Related Items (2)

Engineering Practical Lempel-Ziv Tries ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries



Cites Work

  • Unnamed Item
  • A fast string searching algorithm
  • Efficient randomized pattern-matching algorithms
  • On the Worst-Case Behavior of String-Searching Algorithms
  • Fast Pattern Matching in Strings


This page was built for publication: An analysis of the Karp-Rabin string matching algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:911281&oldid=12874148"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki