Frantisek Franek

According to our database, Frantisek Franek authored at least 50 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited.

Frantisek Franek, Michael Liut

Proceedings of the Prague Stringology Conference 2021, 2021

2020

Computing Maximal Lyndon Substrings of a String.

Frantisek Franek, Michael Liut

Algorithms, 2020

2019

Algorithms to Compute the Lyndon Array Revisited.

Frantisek Franek, Michael Liut

Proceedings of the Prague Stringology Conference 2019, 2019

2018

Reconstructing a string from its Lyndon arrays.

Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth

Theor. Comput. Sci., 2018

On Baier's Sort of Maximal Lyndon Substrings.

Frantisek Franek, Michael Liut, William F. Smyth

Proceedings of the Prague Stringology Conference 2018, 2018

2017

Bannai et al. method proves the d-step conjecture for strings.

Antoine Deza, Frantisek Franek

Discret. Appl. Math., 2017

The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array.

Frantisek Franek, Asma Paracha, William F. Smyth

Proceedings of the Prague Stringology Conference 2017, 2017

2016

Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22].

Haoyue Bai, Antoine Deza, Frantisek Franek

J. Discrete Algorithms, 2016

A computational substantiation of the d-step approach to the number of distinct squares problem.

Antoine Deza, Frantisek Franek, Mei Jiang

Discret. Appl. Math., 2016

The New Periodicity Lemma revisited.

Haoyue Bai, Frantisek Franek, William F. Smyth

Discret. Appl. Math., 2016

Algorithms to Compute the Lyndon Array.

Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth

Proceedings of the Prague Stringology Conference 2016, 2016

2015

On a lemma of Crochemore and Rytter.

Haoyue Bai, Antoine Deza, Frantisek Franek

J. Discrete Algorithms, 2015

How many double squares can a string contain?

Antoine Deza, Frantisek Franek, Adrien Thierry

Discret. Appl. Math., 2015

2014

A d-step approach to the maximum number of distinct squares and runs in strings.

Antoine Deza, Frantisek Franek

Discret. Appl. Math., 2014

On the Number of Distinct Squares.

Frantisek Franek

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Two Squares Canonical Factorization.

Haoyue Bai, Frantisek Franek, William F. Smyth

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013

A computational framework for determining run-maximal strings.

Andrew Baker, Antoine Deza, Frantisek Franek

J. Discrete Algorithms, 2013

2012

More results on overlapping squares.

Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth

J. Discrete Algorithms, 2012

On a conjecture of Erdős for multiplicities of cliques.

Antoine Deza, Frantisek Franek, Min Jing Liu

J. Discrete Algorithms, 2012

On the structure of run-maximal strings.

Andrew Baker, Antoine Deza, Frantisek Franek

J. Discrete Algorithms, 2012

Crochemore's Repetitions Algorithm Revisited: Computing Runs.

Frantisek Franek, Mei Jiang

Int. J. Found. Comput. Sci., 2012

A Computational Framework for Determining Square-maximal Strings.

Antoine Deza, Frantisek Franek, Mei Jiang

Proceedings of the Prague Stringology Conference 2012, 2012

2011

An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm.

Frantisek Franek, Mei Jiang, Chia-Chun Weng

Proceedings of the Prague Stringology Conference 2011, 2011

A Parameterized Formulation for the Maximum Number of Runs Problem.

Andrew Baker, Antoine Deza, Frantisek Franek

Proceedings of the Prague Stringology Conference 2011, 2011

A <i>d</i>-Step Approach for Distinct Squares in Strings.

Antoine Deza, Frantisek Franek, Mei Jiang

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2008

An asymptotic Lower Bound for the Maximal Number of Runs in a String.

Frantisek Franek, Qian Yang

Int. J. Found. Comput. Sci., 2008

Testing Grammars For Top-Down Parsers.

A. M. Paracha, Frantisek Franek

Proceedings of the Innovations and Advances in Computer Sciences and Engineering, 2008

2007

Two-pattern strings II - frequency of occurrence and substring complexity.

Frantisek Franek, Jiandong Jiang, William F. Smyth

J. Discrete Algorithms, 2007

A simple fast hybrid pattern-matching algorithm.

Frantisek Franek, Christopher G. Jennings, William F. Smyth

J. Discrete Algorithms, 2007

2006

Reconstructing a Suffix Array.

Frantisek Franek, William F. Smyth

Int. J. Found. Comput. Sci., 2006

An asymptotic lower bound for the maximal-number-of-runs function.

Frantisek Franek, Qian Yang

Proceedings of the Prague Stringology Conference, 2006

The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach.

Ivan Bruha, Frantisek Franek

Proceedings of the Pattern Recognition in Information Systems, 2006

2005

Sorting suffixes of two-pattern strings.

Frantisek Franek, William F. Smyth

Int. J. Found. Comput. Sci., 2005

2003

A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach.

Frantisek Franek, William F. Smyth, Xiangdong Xiao

Nord. J. Comput., 2003

Two-pattern strings I - A recognition algorithm.

Frantisek Franek, Weilin Lu, William F. Smyth

J. Discrete Algorithms, 2003

Computing all Repeats Using Suffix Arrays.

Frantisek Franek, William F. Smyth, Yudong Tang

J. Autom. Lang. Comb., 2003

Computing Quasi Suffix Arrays.

Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao

J. Autom. Lang. Comb., 2003

2002

Completing the spectrum of 2-chromatic S(2, 4, v).

Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa

Discret. Math., 2002

On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v.

Frantisek Franek, Mike J. Grannell, Terry S. Griggs, Alexander Rosa

Des. Codes Cryptogr., 2002

On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.

Frantisek Franek

Comb., 2002

Two-Pattern Strings.

Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001

Imbalance in tournament designs.

Frantisek Franek, Dalibor Froncek, Alexander Rosa

Australas. J Comb., 2001

2000

Repetitions in Sturmian strings.

Frantisek Franek, Ayse Karaman, W. F. Smyth

Theor. Comput. Sci., 2000

Repetitions in two-pattern strings.

Frantisek Franek, Weilin Lu, William F. Smyth

Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

The simulation of business rules in active databases using expert system approach.

Ivan Bruha, Frantisek Franek, Vladimir L. Rosicky

Proceedings of the 14^th European Simulation Multiconference, 2000

1997

Triangles in 2-factorizations.

Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa

J. Graph Theory, 1997

Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems.

Frantisek Franek, Alexander Rosa, Terry S. Griggs

Des. Codes Cryptogr., 1997

1996

Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm.

Ivan Bruha, Frantisek Franek

Int. J. Pattern Recognit. Artif. Intell., 1996

1993

2-Colorings of complete graphs with a small number of monochromatic K₄ subgraphs.

Frantisek Franek, Vojtech Rödl

Discret. Math., 1993

1992

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.

Frantisek Franek, Vojtech Rödl

Graphs Comb., 1992