The following pages link to Frantisek Franek (Q313758):
Displaying 50 items.
- The new periodicity lemma revisited (Q313759) (← links)
- A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771) (← links)
- Corrigendum to: ``On a lemma of Crochemore and Rytter'' (Q350728) (← links)
- A computational framework for determining run-maximal strings (Q396644) (← links)
- On the structure of run-maximal strings (Q414413) (← links)
- How many double squares can a string contain? (Q476303) (← links)
- On a lemma of Crochemore and Rytter (Q491147) (← links)
- A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
- Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
- (Q685674) (redirect page) (← links)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs (Q685676) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- Two-pattern strings. II: Frequency of occurrence and substring complexity (Q925072) (← links)
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs (Q1205339) (← links)
- Large sets of mutually almost disjoint Steiner triple systems not from Steiner quadruple systems (Q1364210) (← links)
- Two-factorizations of small complete graphs (Q1569867) (← links)
- Completing the spectrum of 2-chromatic \(S(2,4,v)\) (Q1598801) (← links)
- On large sets of \(v-1\) \(L\)-intersecting Steiner triple systems of order \(v\) (Q1611367) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Two-pattern strings. I: A recognition algorithm (Q1827270) (← links)
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6 (Q1872896) (← links)
- More results on overlapping squares (Q2376782) (← links)
- On a conjecture of Erdős for multiplicities of cliques (Q2376784) (← links)
- (Q2712527) (← links)
- (Q2785716) (← links)
- CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS (Q2909203) (← links)
- A d-Step Approach for Distinct Squares in Strings (Q3011845) (← links)
- (Q3012574) (← links)
- Independent Families in Complete Boolean Algebras (Q3043203) (← links)
- (Q3084791) (← links)
- RECONSTRUCTING A SUFFIX ARRAY (Q3421844) (← links)
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING (Q3532151) (← links)
- Cliques in Steiner systems (Q3601028) (← links)
- Certain Values of Completeness and Saturatedness of a Uniform Ideal Rule out Certain Sizes of The Underlying Index Set (Q3710521) (← links)
- Isomorphisms of Trees (Q3727985) (← links)
- Completion of Factor Algebras of Ideals (Q3754651) (← links)
- (Q3980549) (← links)
- (Q3981347) (← links)
- (Q4016814) (← links)
- (Q4204145) (← links)
- (Q4326184) (← links)
- Structural properties of universal minimal dynamical systems for discrete semigroups (Q4336536) (← links)
- (Q4362089) (← links)
- (Q4454546) (← links)
- (Q4487079) (← links)
- (Q4513440) (← links)
- (Q4660320) (← links)
- (Q4697573) (← links)
- (Q4710511) (← links)
- (Q4737691) (← links)
