Frantisek Franek

57 papers B 3Misc 16Journal 34Unranked 4
YearRankTypeTitle / Venue / Authors
2025 Misc conf
On Periodicities in Strings.
PSC
Frantisek Franek
2021 Misc conf
Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited.
PSC
Frantisek Franek, Michael Liut
2020 J jnl
Computing Maximal Lyndon Substrings of a String.
Algorithms
Frantisek Franek, Michael Liut
2019 Misc conf
Algorithms to Compute the Lyndon Array Revisited.
PSC
Frantisek Franek, Michael Liut
2018 Misc conf
On Baier's Sort of Maximal Lyndon Substrings.
PSC
Frantisek Franek, Michael Liut, William F. Smyth
2018 J jnl
Reconstructing a string from its Lyndon arrays.
Theor. Comput. Sci.
Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth
2017 J jnl
Bannai et al. method proves the d-step conjecture for strings.
Discret. Appl. Math.
Antoine Deza, Frantisek Franek
2017 Misc conf
The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array.
PSC
Frantisek Franek, Asma Paracha, William F. Smyth
2016 J jnl
A computational substantiation of the d-step approach to the number of distinct squares problem.
Discret. Appl. Math.
Antoine Deza, Frantisek Franek, Mei Jiang
2016 Misc conf
Algorithms to Compute the Lyndon Array.
PSC
Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth
2016 J jnl
Algorithms to Compute the Lyndon Array.
CoRR
Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman, William F. Smyth
2016 J jnl
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].
J. Discrete Algorithms
Haoyue Bai, Antoine Deza, Frantisek Franek
2016 J jnl
The New Periodicity Lemma revisited.
Discret. Appl. Math.
Haoyue Bai, Frantisek Franek, William F. Smyth
2015 J jnl
How many double squares can a string contain?
Discret. Appl. Math.
Antoine Deza, Frantisek Franek, Adrien Thierry
2015 J jnl
On a lemma of Crochemore and Rytter.
J. Discrete Algorithms
Haoyue Bai, Antoine Deza, Frantisek Franek
2014 J jnl
A d-step approach to the maximum number of distinct squares and runs in strings.
Discret. Appl. Math.
Antoine Deza, Frantisek Franek
2014 Misc conf
On the Number of Distinct Squares.
PSC
Frantisek Franek
2014 Misc conf
Two Squares Canonical Factorization.
PSC
Haoyue Bai, Frantisek Franek, William F. Smyth
2013 J jnl
A computational framework for determining run-maximal strings.
J. Discrete Algorithms
Andrew Baker, Antoine Deza, Frantisek Franek
2012 Misc conf
A Computational Framework for Determining Square-maximal Strings.
PSC
Antoine Deza, Frantisek Franek, Mei Jiang
2012 J jnl
Crochemore's Repetitions Algorithm Revisited: Computing Runs.
Int. J. Found. Comput. Sci.
Frantisek Franek, Mei Jiang
2012 J jnl
More results on overlapping squares.
J. Discrete Algorithms
Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth
2012 J jnl
On a conjecture of Erdős for multiplicities of cliques.
J. Discrete Algorithms
Antoine Deza, Frantisek Franek, Min Jing Liu
2012 J jnl
On the structure of run-maximal strings.
J. Discrete Algorithms
Andrew Baker, Antoine Deza, Frantisek Franek
2011 B conf
A
CPM
Antoine Deza, Frantisek Franek, Mei Jiang
2011 Misc conf
A Parameterized Formulation for the Maximum Number of Runs Problem.
PSC
Andrew Baker, Antoine Deza, Frantisek Franek
2011 Misc conf
An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm.
PSC
Frantisek Franek, Mei Jiang, Chia-Chun Weng
2009 Misc conf
Crochemore's Repetitions Algorithm Revisited - Computing Runs.
PSC
Frantisek Franek, Mei Jiang
2008 J jnl
An asymptotic Lower Bound for the Maximal Number of Runs in a String.
Int. J. Found. Comput. Sci.
Frantisek Franek, Qian Yang
2008 — conf
Testing Grammars For Top-Down Parsers.
SCSS (1)
A. M. Paracha, Frantisek Franek
2007 J jnl
A simple fast hybrid pattern-matching algorithm.
J. Discrete Algorithms
Frantisek Franek, Christopher G. Jennings, William F. Smyth
2007 J jnl
Two-pattern strings II - frequency of occurrence and substring complexity.
J. Discrete Algorithms
Frantisek Franek, Jiandong Jiang, William F. Smyth
2006 Misc conf
An asymptotic lower bound for the maximal-number-of-runs function.
PSC
Frantisek Franek, Qian Yang
2006 J jnl
Reconstructing a Suffix Array.
Int. J. Found. Comput. Sci.
Frantisek Franek, William F. Smyth
2006 — conf
The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach.
PRIS
Ivan Bruha, Frantisek Franek
2005 B conf
A Simple Fast Hybrid Pattern-Matching Algorithm.
CPM
Frantisek Franek, Christopher G. Jennings, William F. Smyth
2005 Misc conf
Reconstructing a suffix array.
PSC
Frantisek Franek, William F. Smyth
2005 J jnl
Sorting suffixes of two-pattern strings.
Int. J. Found. Comput. Sci.
Frantisek Franek, William F. Smyth
2004 Misc conf
Sorting suffixes of two-pattern strings.
PSC
Frantisek Franek, William F. Smyth
2003 J jnl
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach.
Nord. J. Comput.
Frantisek Franek, William F. Smyth, Xiangdong Xiao
2003 J jnl
Computing Quasi Suffix Arrays.
J. Autom. Lang. Comb.
Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao
2003 J jnl
Computing all Repeats Using Suffix Arrays.
J. Autom. Lang. Comb.
Frantisek Franek, William F. Smyth, Yudong Tang
2003 J jnl
Two-pattern strings I - A recognition algorithm.
J. Discrete Algorithms
Frantisek Franek, Weilin Lu, William F. Smyth
2002 Misc conf
A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach.
PSC
Frantisek Franek, William F. Smyth, Xiangdong Xiao
2002 J jnl
Completing the spectrum of 2-chromatic S(2, 4, v).
Discret. Math.
Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa
2002 J jnl
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.
Comb.
Frantisek Franek
2002 J jnl
On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v.
Des. Codes Cryptogr.
Frantisek Franek, Mike J. Grannell, Terry S. Griggs, Alexander Rosa
2002 B conf
Two-Pattern Strings.
CPM
Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth
2001 J jnl
Imbalance in tournament designs.
Australas. J Comb.
Frantisek Franek, Dalibor Froncek, Alexander Rosa
2000 J jnl
Repetitions in Sturmian strings.
Theor. Comput. Sci.
Frantisek Franek, Ayse Karaman, W. F. Smyth
2000 — conf
Repetitions in two-pattern strings.
PSCW
Frantisek Franek, Weilin Lu, William F. Smyth
2000 — conf
The simulation of business rules in active databases using expert system approach.
ESM
Ivan Bruha, Frantisek Franek, Vladimir L. Rosicky
1997 J jnl
Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems.
Des. Codes Cryptogr.
Frantisek Franek, Alexander Rosa, Terry S. Griggs
1997 J jnl
Triangles in 2-factorizations.
J. Graph Theory
Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa
1996 J jnl
Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm.
Int. J. Pattern Recognit. Artif. Intell.
Ivan Bruha, Frantisek Franek
1993 J jnl
2-Colorings of complete graphs with a small number of monochromatic K
Discret. Math.
Frantisek Franek, Vojtech Rödl
1992 J jnl
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Graphs Comb.
Frantisek Franek, Vojtech Rödl