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

Parallel String Matching Algorithms

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

DOI10.1108/EB005791zbMath0663.68080OpenAlexW2014012721MaRDI QIDQ3814826

Souad Ghanemi, David J. Evans

Publication date: 1988

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/eb005791


zbMATH Keywords

parallel algorithmpattern matchingstring searchingMIMD parallel computer systems


Mathematics Subject Classification ID

Searching and sorting (68P10) Software, source code, etc. for problems pertaining to computer science (68-04)





Cites Work

  • On improving the worst case running time of the Boyer-Moore string matching algorithm
  • A fast string searching algorithm
  • Efficient string matching
  • Fast Pattern Matching in Strings




This page was built for publication: Parallel String Matching Algorithms

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