Frantisek Franek

From MaRDI portal
Person:313758

Available identifiers

zbMath Open franek.frantisekDBLP10/2943WikidataQ102167263 ScholiaQ102167263MaRDI QIDQ313758

List of research outcomes





PublicationDate of PublicationType
Reconstructing a string from its Lyndon arrays2018-02-16Paper
Bannai et al. method proves the \(d\)-step conjecture for strings2017-03-15Paper
Corrigendum to: ``On a lemma of Crochemore and Rytter2016-12-09Paper
The new periodicity lemma revisited2016-09-12Paper
A computational substantiation of the \(d\)-step approach to the number of distinct squares problem2016-09-12Paper
A \(d\)-step approach to the maximum number of distinct squares and runs in strings2015-09-22Paper
On a lemma of Crochemore and Rytter2015-08-24Paper
How many double squares can a string contain?2014-11-28Paper
A computational framework for determining run-maximal strings2014-08-13Paper
https://portal.mardi4nfdi.de/entity/Q51695792014-07-10Paper
More results on overlapping squares2013-06-24Paper
On a conjecture of Erdős for multiplicities of cliques2013-06-24Paper
Crochemore's repetitions algorithm revisited: computing runs2012-08-30Paper
On the structure of run-maximal strings2012-05-11Paper
https://portal.mardi4nfdi.de/entity/Q30125742011-07-06Paper
A d-Step Approach for Distinct Squares in Strings2011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30847912011-03-25Paper
Cliques in Steiner systems2009-02-09Paper
AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING2008-11-03Paper
A simple fast hybrid pattern-matching algorithm2008-05-29Paper
Two-pattern strings. II: Frequency of occurrence and substring complexity2008-05-29Paper
RECONSTRUCTING A SUFFIX ARRAY2007-02-08Paper
SORTING SUFFIXES OF TWO-PATTERN STRINGS2005-12-15Paper
Combinatorial Pattern Matching2005-12-14Paper
https://portal.mardi4nfdi.de/entity/Q46603202005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q48208702004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208692004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376912004-08-11Paper
Two-pattern strings. I: A recognition algorithm2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44545462004-03-08Paper
On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 62003-05-18Paper
https://portal.mardi4nfdi.de/entity/Q47958552003-04-06Paper
On large sets of \(v-1\) \(L\)-intersecting Steiner triple systems of order \(v\)2002-08-21Paper
Completing the spectrum of 2-chromatic \(S(2,4,v)\)2002-05-28Paper
Imbalance in tournament designs2001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44870792000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q45134402000-11-15Paper
Two-factorizations of small complete graphs2000-07-09Paper
Large sets of mutually almost disjoint Steiner triple systems not from Steiner quadruple systems1998-07-06Paper
https://portal.mardi4nfdi.de/entity/Q43620891998-03-24Paper
Structural properties of universal minimal dynamical systems for discrete semigroups1997-05-13Paper
A completion conjecture for Kirkman triple systems1997-04-21Paper
https://portal.mardi4nfdi.de/entity/Q43261841995-07-13Paper
https://portal.mardi4nfdi.de/entity/Q46975731995-05-01Paper
2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs1993-10-24Paper
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40168141993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39813471992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39805491992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47105111992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q42041451989-01-01Paper
Completion of Factor Algebras of Ideals1987-01-01Paper
Certain Values of Completeness and Saturatedness of a Uniform Ideal Rule out Certain Sizes of The Underlying Index Set1985-01-01Paper
Isomorphisms of Trees1985-01-01Paper
Independent Families in Complete Boolean Algebras1982-01-01Paper

Research outcomes over time

This page was built for person: Frantisek Franek