Lexicographically least circular substrings
- 5 July 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 10 (4-5) , 240-242
- https://doi.org/10.1016/0020-0190(80)90149-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A fast equivalence-checking algorithm for circular listsInformation Processing Letters, 1979
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Linear pattern matching algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1973