Frantisek Franek

Publication Activity (10 Years)

Years Active: 1992-2021
Publications (10 Years): 12

Top Topics

Computational Framework

Hough Transform

Top Venues

J. Discrete Algorithms

Discret. Appl. Math.

Publications

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