Non-standard stringology: algorithms and complexity

DOI10.1145/195058.195457MaRDI QIDQ2817673zbMATH OpenOpenAlexFDO

Authors S. Muthukrishnan, Krishna Palem

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195457

zbMATH Keywords

string matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Algorithms on strings (68W32)

Recommendations

• Stringology algorithms
• An algorithmic approach to string phenomenology
• Preface: Stringology algorithms
• Editorial: Stringology algorithms
• scientific article; zbMATH DE number 1336330
• The finite automata approaches in stringology
• Complexity of virtual multistrings
• A formal framework for stringology

Cited in

(10)

• String matching under a general matching relation
• Towards optimal packed string matching
• Relational codes of words
• A matching algorithm in PMWL based on CluTree
• On the average-case complexity of pattern matching with wildcards
• Maximum number of distinct and nonequivalent nonstandard squares in a word
• Faster evaluation of subtraction games
• scientific article; zbMATH DE number 3982538 (Why is no real title available?)
• On the decision tree complexity of string matching
• Resource scheduling with variable requirements over time

This page was built for publication: Non-standard stringology: algorithms and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817673)