String overlaps, pattern matching, and nontransitive games
Authors:
- L.J GuibasLGL.J Guibas
- A.M OdlyzkoAOA.M Odlyzko
- 1 March 1981
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 30 (2) , 183-208
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Periods in stringsJournal of Combinatorial Theory, Series A, 1981
- A New Proof of the Linearity of the Boyer-Moore String Searching AlgorithmSIAM Journal on Computing, 1980
- Some Combinatorial Properties of Free SemigroupsJournal of the London Mathematical Society, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Non-Transitive DominanceMathematics Magazine, 1976
- Note on a clustering problemJournal of Applied Probability, 1975
- Mathematical GamesScientific American, 1974
- On the expected duration of a search for a fixed pattern in random data (Corresp.)IEEE Transactions on Information Theory, 1973
- Recurrent composite eventsJournal of Applied Probability, 1967
- A Note on the Class-Numbers of Algebraic Number FieldsAmerican Journal of Mathematics, 1956