Frantisek Franek

According to our database1, Frantisek Franek authored at least 48 papers between 1992 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Reconstructing a string from its Lyndon arrays.
Theor. Comput. Sci., 2018

2017
Bannai et al. method proves the d-step conjecture for strings.
Discrete Applied Mathematics, 2017

The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array.
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].
J. Discrete Algorithms, 2016

A computational substantiation of the d-step approach to the number of distinct squares problem.
Discrete Applied Mathematics, 2016

The New Periodicity Lemma revisited.
Discrete Applied Mathematics, 2016

Algorithms to Compute the Lyndon Array.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
On a lemma of Crochemore and Rytter.
J. Discrete Algorithms, 2015

How many double squares can a string contain?
Discrete Applied Mathematics, 2015

2014
A d-step approach to the maximum number of distinct squares and runs in strings.
Discrete Applied Mathematics, 2014

On the Number of Distinct Squares.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Two Squares Canonical Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013
A computational framework for determining run-maximal strings.
J. Discrete Algorithms, 2013

2012
More results on overlapping squares.
J. Discrete Algorithms, 2012

On a conjecture of Erdős for multiplicities of cliques.
J. Discrete Algorithms, 2012

On the structure of run-maximal strings.
J. Discrete Algorithms, 2012

Crochemore's Repetitions Algorithm Revisited: Computing Runs.
Int. J. Found. Comput. Sci., 2012

A Computational Framework for Determining Square-maximal Strings.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm.
Proceedings of the Prague Stringology Conference 2011, 2011

A Parameterized Formulation for the Maximum Number of Runs Problem.
Proceedings of the Prague Stringology Conference 2011, 2011

A d-Step Approach for Distinct Squares in Strings.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2009
Crochemore's Repetitions Algorithm Revisited - Computing Runs.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
An asymptotic Lower Bound for the Maximal Number of Runs in a String.
Int. J. Found. Comput. Sci., 2008

Testing Grammars For Top-Down Parsers.
Proceedings of the Innovations and Advances in Computer Sciences and Engineering, 2008

2007
Two-pattern strings II - frequency of occurrence and substring complexity.
J. Discrete Algorithms, 2007

2006
An asymptotic lower bound for the maximal-number-of-runs function.
Proceedings of the Prague Stringology Conference, 2006

The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach.
Proceedings of the Pattern Recognition in Information Systems, 2006

2005
Reconstructing a suffix array.
Proceedings of the Prague Stringology Conference, 2005

A Simple Fast Hybrid Pattern-Matching Algorithm.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004
Sorting suffixes of two-pattern strings.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

2003
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach.
Nord. J. Comput., 2003

Two-pattern strings I - A recognition algorithm.
J. Discrete Algorithms, 2003

Computing all Repeats Using Suffix Arrays.
Journal of Automata, Languages and Combinatorics, 2003

Computing Quasi Suffix Arrays.
Journal of Automata, Languages and Combinatorics, 2003

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

On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v.
Des. Codes Cryptography, 2002

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

A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach.
Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

Two-Pattern Strings.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2001
Imbalance in tournament designs.
Australasian J. Combinatorics, 2001

2000
Repetitions in Sturmian strings.
Theor. Comput. Sci., 2000

Repetitions in two-pattern strings.
Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

The simulation of business rules in active databases using expert system approach.
Proceedings of the 14<sup>th</sup> European Simulation Multiconference, 2000

1997
Triangles in 2-factorizations.
Journal of Graph Theory, 1997

Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems.
Des. Codes Cryptography, 1997

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

1993
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs.
Discrete Mathematics, 1993

1992
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Graphs and Combinatorics, 1992


  Loading...