Lex

Browse

GenresShelvesPremiumBlog

Company

AboutJobsPartnersSell on LexAffiliates

Resources

DocsInvite FriendsFAQ

Legal

Terms of ServicePrivacy Policygeneral@lex-books.com(215) 703-8277

© 2026 LexBooks, Inc. All rights reserved.

An O(n log n) algorithm for finding repetition in a string

An O(n log n) algorithm for finding repetition in a string1980

M. Main

Details

First published
1980
OL Work ID
OL1947891W

Subjects

AlgorithmsComputer programming

Find this book

Open Library
Book data from Open Library. Cover images courtesy of Open Library.