A-step approach to the maximum number of distinct squares and runs in strings
Authors:
- Antoine DezaADAntoine Deza
- Frantisek FranekFFFrantisek Franek
- 1 January 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 163, 268-274
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
- Mitacs
This publication has 14 references indexed in Scilit:
- A computational framework for determining run-maximal stringsJournal of Discrete Algorithms, 2013
- A counterexample to the Hirsch ConjectureAnnals of Mathematics, 2012
- A Continuous d-Step Conjecture for PolytopesDiscrete & Computational Geometry, 2008
- A note on the number of squares in a wordTheoretical Computer Science, 2007
- A simple proof that a word of length n has at most 2n distinct squaresJournal of Combinatorial Theory, Series A, 2005
- How Many Squares Can a String Contain?Journal of Combinatorial Theory, Series A, 1998
- A characterization of the squares in a Fibonacci stringTheoretical Computer Science, 1997
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- Detecting leftmost maximal periodicitiesDiscrete Applied Mathematics, 1989
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981