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

Average case analysis of the Boyer‐Moore algorithm

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

DOI10.1002/rsa.20111zbMath1110.68165OpenAlexW4252328073MaRDI QIDQ5486324

Tsung-Hsi Tsai

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20111


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items

Optimal pattern matching algorithms, An algorithm to compute the character access count distribution for pattern matching algorithms, IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences, Designing optimal- and fast-on-average pattern matching algorithms, The wide window string matching algorithm, Improved pattern-scan-order algorithms for string matching



Cites Work

  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5486324&oldid=30033489"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 04:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki