Frantisek Franek

发表

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

Frantisek Franek, Mei Jiang, Chia-Chun Weng, 2011, Stringology.

Two-Pattern Strings

Frantisek Franek, Jiandong Jiang, Weilin Lu, 2002, CPM.

Two-pattern strings I - A recognition algorithm

Frantisek Franek, Weilin Lu, William F. Smyth, 2003, J. Discrete Algorithms.

Testing Grammars For Top-Down Parsers

Frantisek Franek, A. M. Paracha, 2008, SCSS.

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

Frantisek Franek, 2002, Comb..

On a lemma of Crochemore and Rytter

Frantisek Franek, Antoine Deza, Haoyue Bai, 2015, J. Discrete Algorithms.

Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm

Frantisek Franek, Ivan Bruha, 2003 .

How many double squares can a string contain?

Frantisek Franek, Antoine Deza, Adrien Thierry, 2015, Discret. Appl. Math..

The New Periodicity Lemma revisited

Frantisek Franek, William F. Smyth, Haoyue Bai, 2016, Discret. Appl. Math..

Memory as a Programming Concept in C and C++: Thread-Safe and Process - Safe Reporting and Logging Functions

Frantisek Franek, 2003 .

On a conjecture of Erdős for multiplicities of cliques

Frantisek Franek, Antoine Deza, Min Jing Liu, 2012, J. Discrete Algorithms.

A Computational Framework for Determining Square-maximal Strings

Frantisek Franek, Mei Jiang, Antoine Deza, 2012, Stringology.

Two Squares Canonical Factorization

Frantisek Franek, William F. Smyth, Haoyue Bai, 2014, Stringology.

Reconstructing a string from its Lyndon arrays

Frantisek Franek, William F. Smyth, Jacqueline W. Daykin, 2017, Theor. Comput. Sci..

A d-Step Approach for Distinct Squares in Strings

Frantisek Franek, Mei Jiang, Antoine Deza, 2011, CPM.

Computing Quasi Suffix Arrays

Frantisek Franek, William F. Smyth, Jan Holub, 2003, J. Autom. Lang. Comb..

Memory as a Programming Concept in C and C++: Programs in Execution: Processes and Threads

Frantisek Franek, F. Franek, 2003 .

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

Frantisek Franek, Ivan Bruha, Vladimir L. Rosicky, 2000, ESM.

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

Frantisek Franek, William F. Smyth, Xiangdong Xiao, 2003, Nord. J. Comput..

2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs

Vojtech Rödl, Frantisek Franek, 1993, Discret. Math..

Memory as a Programming Concept in C and C++: Contents

Frantisek Franek, 2003 .

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

Terry S. Griggs, Frantisek Franek, Alexander Rosa, 2002, Discret. Math..

More results on overlapping squares

Frantisek Franek, William F. Smyth, Jamie Simpson, 2012, J. Discrete Algorithms.

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

Qian Yang, Frantisek Franek, 2006, Stringology.

Memory as a Programming Concept in C and C++: One-Dimensional Arrays and Strings

Frantisek Franek, 2003 .

Repetitions in Sturmian strings

Frantisek Franek, William F. Smyth, Ayse Karaman, 2000, Theor. Comput. Sci..

Triangles in 2-factorizations

Frantisek Franek, Alexander Rosa, Italo J. Dejter, 1997, J. Graph Theory.

A Prototype for an Intelligent Tutoring System for Students Learning to Program in Java

Frantisek Franek, E. R. Sykes, E. Sykes, 2004 .

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

Frantisek Franek, Antoine Deza, Haoyue Bai, 2016, J. Discrete Algorithms.

Algorithms to Compute the Lyndon Array pdf

Frantisek Franek, Mohammad Sohel Rahman, William F. Smyth, 2016, Stringology.

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

Frantisek Franek, Antoine Deza, 2017, Discret. Appl. Math..

Sorting suffixes of two-pattern strings

Frantisek Franek, William F. Smyth, 2005, Int. J. Found. Comput. Sci..

Tracing Objects in C

Frantisek Franek, 2003 .

Memory as a Programming Concept in C and C++: Tracing Objects and Memory in C++

Frantisek Franek, 2003 .

Reconstructing a Suffix Array

Frantisek Franek, William F. Smyth, W. F. Smyth, 2006, Int. J. Found. Comput. Sci..

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

Frantisek Franek, Mei Jiang, Antoine Deza, 2016, Discret. Appl. Math..

Memory as a Programming Concept in C and C++: Functions and Function Calls

Frantisek Franek, 2003 .

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

Qian Yang, Frantisek Franek, 2008, Int. J. Found. Comput. Sci..

Crochemore's Repetitions Algorithm Revisited: Computing Runs

Frantisek Franek, Mei Jiang, 2012, Int. J. Found. Comput. Sci..

Imbalance in tournament designs

Frantisek Franek, Alexander Rosa, Dalibor Froncek, 2001, Australas. J Comb..

Memory as a Programming Concept in C and C++: Memory Leaks and Their Debugging

Frantisek Franek, 2003 .

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

Frantisek Franek, Antoine Deza, 2014, Discret. Appl. Math..

Repetitions in two-pattern strings

Frantisek Franek, Weilin Lu, William F. Smyth, 2000, Stringology.

Computing all Repeats Using Suffix Arrays

Frantisek Franek, William F. Smyth, W. F. Smyth, 2003, J. Autom. Lang. Comb..

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

Terry S. Griggs, Frantisek Franek, Alexander Rosa, 1997, Des. Codes Cryptogr..

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

Frantisek Franek, Ivan Bruha, 2006, PRIS.

A simple fast hybrid pattern-matching algorithm

Frantisek Franek, William F. Smyth, Christopher G. Jennings, 2007, J. Discrete Algorithms.

From Source File to Executable File

Frantisek Franek, 2003 .

A computational framework for determining run-maximal strings

Frantisek Franek, Antoine Deza, Andrew Baker, 2013, J. Discrete Algorithms.

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

Frantisek Franek, Ivan Bruha, I. Bruha, 1996, Int. J. Pattern Recognit. Artif. Intell..

On the Number of Distinct Squares

Frantisek Franek, 2014, Stringology.

Memory as a Programming Concept in C and C++: Dynamic Allocation and Deallocation of Memory

Frantisek Franek, 2003 .

Memory as a Programming Concept in C and C++: Variables and Objects; Pointers and Addresses

Frantisek Franek, 2003 .

Memory as a Programming Concept in C and C++: Linked Data Structures

Frantisek Franek, 2003 .

A Parameterized Formulation for the Maximum Number of Runs Problem

Frantisek Franek, Antoine Deza, Andrew Baker, 2011, Stringology.

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

Mike J. Grannell, Terry S. Griggs, Frantisek Franek, 2002, Des. Codes Cryptogr..

A Simple Fast Hybrid Pattern-Matching Algorithm

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

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

Frantisek Franek, Jiandong Jiang, William F. Smyth, 2007, J. Discrete Algorithms.

On the structure of run-maximal strings

Frantisek Franek, Antoine Deza, Andrew Baker, 2012, J. Discrete Algorithms.

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

Frantisek Franek, William F. Smyth, Asma Paracha, 2017, Stringology.

Memory as a Programming Concept in C and C

Frantisek Franek, 2003 .

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

Vojtech Rödl, Frantisek Franek, 1992, Graphs Comb..

Memory as a Programming Concept in C and C++: Multi-Dimensional Arrays

Frantisek Franek, 2003 .

On a conjecture of Erd ˝ os for multiplicities of cliques

Frantisek Franek, Antoine Deza, Jing Liu, 2002 .

A Different Proof of Crochemore-Ilie Lemma Concerning Microruns 1

Frantisek Franek, Jan Holub, 2009 .

A Parallel Approach to Computing Runs in a String

Frantisek Franek, Mei Jiang, 2010 .

Two-factorizations of small complete graphs

Frantisek Franek, Alexander Rosa, A. Rosa, 2000 .

Completion of factor algebras of ideals

Frantisek Franek, Bohuslav Balcar, F. Franek, 1987 .