Non-standard stringology
From MaRDI portal
Publication:2817673
DOI10.1145/195058.195457zbMath1345.68305OpenAlexW2011996797MaRDI QIDQ2817673
No author found.
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
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Algorithms on strings (68W32)
Related Items (8)
A matching algorithm in PMWL based on CluTree ⋮ Resource scheduling with variable requirements over time ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ Covering problems for partial words and for indeterminate strings ⋮ On the average-case complexity of pattern matching with wildcards ⋮ Towards optimal packed string matching ⋮ Relational codes of words ⋮ Faster Evaluation of Subtraction Games
This page was built for publication: Non-standard stringology
