The DOI matches its Crossref record.
Computation of squares in a string: Preliminary version
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The same strategy allows solving the problem of computing in linear time, for integer alphabets, the length of the shortest (or longest) square ending (or starting) at each position of a given word; this improves the results by Kosaraju (1994); Xu (2010), where such a result was only shown for constant size alphabets.”
From Longest Gapped Repeats and Palindromes (2017) · cites this paper as Kosaraju (1994)
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 11
- A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string, Theoretical Computer Science, pages 297–315, 1983. · doi:10.1016/0304-3975(83)90109-3
- W. L. Chang and E. L. Lawler. Approximate string matching in sublinear expected time. Proc. of 31st IEEE FOCS, pages 116–124, 1990. · DOI
- M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 97–107. Springer-Verlag, 1985. · doi:10.1007/978-3-642-82456-2_7
- M. Crochemore. An optimal algorithm for computing the repetitions in a word, Inf. Processing Letters 12, pages 244–250, 1981. · DOI
- M. Crochemore. Transducers and repetitions, Theoretical Computer Science, pages 63–86, 1986. · DOI · Paper page
- M. G. Main and R. J. Lorentz. An O(n log n) algorithm for finding all repetitions in a string, J. of Algorithms, pages 422–432, 1984. · doi:10.1016/0196-6774(84)90021-x
- M. G. Main and R. L. Lorentz. Linear time recognition of squarefree strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 271–278, Springer-Verlag, 1985. · DOI · Paper page
- E. M. McCreight. A space-economical suffix tree construction algorithm. J. of ACM, pages 262–272, 1976. · DOI · Paper page
- M. O. Rabin. Discovering repetitions in strings. In A. Apostolico and Z. Galil. editors, Combinatorial Algorithms on Words, pages 279–288. Springer-Verlag, 1985. · doi:10.1007/978-3-642-82456-2_19
- A. O. Slisenko. Detection of periodicities and string-matching in real time. J. of Soviet Mathematics, pages 1316–1386. 1983. · doi:10.1007/bf01084395
- P. Weiner. Linear pattern matching algorithms. Proc. of 14th IEEE Symp. on Switching & Automata Theory, pages 1–11, 1973. · DOI · Paper page
Cited by
Longest Gapped Repeats and Palindromes
Dumitran, M., Gawrychowski, P., & Manea, F. (2017) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-19-4-4 · Cited by 11
Metadata
- Authors
- Kosaraju, S. R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- Pages
- 146-150
- ISSN
- 0302-9743
- 1611-3349
- Cited by
- 17
- References
- 0
- Language
- en
- Licence
- www.springer.com/tdm (tdm)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computation of squares in a string: Preliminary version. https://app.cochat.ai/papers/10.1007/3-540-58094-8_13
- The paper
- Kosaraju, S. R. (1994). Computation of squares in a string: Preliminary version. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-58094-8_13
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
