(Q64357146)

English

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

No description defined

In more languages

default for all languages

No label defined

No description defined

edit

Statements

instance of

scholarly article

0 references

title

An O(n log n) algorithm for finding all repetitions in a string (English)

0 references

author name string

Michael G Main

series ordinal

1

0 references

Richard J Lorentz

series ordinal

2

0 references

publication date

September 1984

0 references

published in

Journal of Algorithms

0 references

volume

5

0 references

issue

3

0 references

page(s)

422-432

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

Unending chess, symbolic dynamics and a problem in semigroups

1 reference

19 June 2022

https://opencitations.net/index/coci/api/v1/citations/10.1215/S0012-7094-44-01101-4

Identifiers

DOI

10.1016/0196-6774(84)90021-X

0 references

DBLP publication ID

journals/jal/MainL84

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

zbMATH Open document ID

0547.68083

0 references

(Q64357146)

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

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)