| 2008 |
|---|
| 18 | EE | Frantisek Franek,
Qian Yang:
An asymptotic Lower Bound for the Maximal Number of Runs in a String.
Int. J. Found. Comput. Sci. 19(1): 195-203 (2008) |
| 2007 |
|---|
| 17 | EE | Frantisek Franek,
Christopher G. Jennings,
William F. Smyth:
A simple fast hybrid pattern-matching algorithm.
J. Discrete Algorithms 5(4): 682-695 (2007) |
| 16 | EE | Frantisek Franek,
Jiandong Jiang,
William F. Smyth:
Two-pattern strings II - frequency of occurrence and substring complexity.
J. Discrete Algorithms 5(4): 739-748 (2007) |
| 2006 |
|---|
| 15 | | Ivan Bruha,
Frantisek Franek:
The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach.
PRIS 2006: 119-126 |
| 14 | EE | Frantisek Franek,
Qian Yang:
An asymptotic lower bound for the maximal-number-of-runs function.
Stringology 2006: 3-8 |
| 13 | EE | Frantisek Franek,
William F. Smyth:
Reconstructing a Suffix Array.
Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006) |
| 2005 |
|---|
| 12 | EE | Frantisek Franek,
Christopher G. Jennings,
William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm.
CPM 2005: 288-297 |
| 11 | | Frantisek Franek,
William F. Smyth:
Reconstructing a suffix array.
Stringology 2005: 54-68 |
| 10 | EE | Frantisek Franek,
William F. Smyth:
Sorting suffixes of two-pattern strings.
Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005) |
| 2004 |
|---|
| 9 | EE | Frantisek Franek,
William F. Smyth:
Sorting suffixes of two-pattern strings.
Stringology 2004: 69-78 |
| 2003 |
|---|
| 8 | EE | Frantisek Franek,
Weilin Lu,
William F. Smyth:
Two-pattern strings I - A recognition algorithm.
J. Discrete Algorithms 1(5-6): 445-460 (2003) |
| 7 | | Frantisek Franek,
William F. Smyth,
Yudong Tang:
Computing All Repeats Using Suffix Arrays.
Journal of Automata, Languages and Combinatorics 8(4): 579-591 (2003) |
| 6 | | Frantisek Franek,
Jan Holub,
William F. Smyth,
Xiangdong Xiao:
Computing Quasi Suffix Arrays.
Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003) |
| 5 | | Frantisek Franek,
William F. Smyth,
Xiangdong Xiao:
A Note on Crochemore's Repetitions Algorithm - A Fast Space-Efficient Approach.
Nord. J. Comput. 10(1): 21-28 (2003) |
| 2002 |
|---|
| 4 | EE | Frantisek Franek,
Jiandong Jiang,
Weilin Lu,
William F. Smyth:
Two-Pattern Strings.
CPM 2002: 76-84 |
| 3 | EE | Frantisek Franek:
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.
Combinatorica 22(3): 451-454 (2002) |
| 2000 |
|---|
| 2 | | Ivan Bruha,
Frantisek Franek,
Vladimir L. Rosicky:
The simulation of business rules in active databases using expert system approach.
ESM 2000: 67-71 |
| 1996 |
|---|
| 1 | | Ivan Bruha,
Frantisek Franek:
Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm.
IJPRAI 10(8): 939-955 (1996) |
