| | |
Department of Computing and Software, McMaster University, Hamilton, Canada
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 28 |      | Frantisek Franek, Mei Jiang: Crochemore's Repetitions Algorithm Revisited: Computing Runs. Int. J. Found. Comput. Sci. 23(2): 389-401 (2012) |
| 27 | | Andrew Baker, Antoine Deza, Frantisek Franek: On the structure of run-maximal strings. J. Discrete Algorithms 10: 10-14 (2012) |
| 2011 | ||
| 26 | | Antoine Deza, Frantisek Franek, Mei Jiang: A d-Step Approach for Distinct Squares in Strings. CPM 2011: 77-89 |
| 2009 | ||
| 25 | | Frantisek Franek, Mei Jiang: Crochemore's Repetitions Algorithm Revisited - Computing Runs. Stringology 2009: 214-224 |
| 2008 | ||
| 24 | | A. M. Paracha, Frantisek Franek: Testing Grammars For Top-Down Parsers. SCSS (1) 2008: 451-456 |
| 23 | | 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 | ||
| 22 | | Frantisek Franek, Christopher G. Jennings, William F. Smyth: A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5(4): 682-695 (2007) |
| 21 | | 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 | ||
| 20 |  | Ivan Bruha, Frantisek Franek: The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach. PRIS 2006: 119-126 |
| 19 | | Frantisek Franek, Qian Yang: An asymptotic lower bound for the maximal-number-of-runs function. Stringology 2006: 3-8 |
| 18 | | Frantisek Franek, William F. Smyth: Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006) |
| 2005 | ||
| 17 | | Frantisek Franek, Christopher G. Jennings, William F. Smyth: A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297 |
| 16 | | Frantisek Franek, William F. Smyth: Reconstructing a suffix array. Stringology 2005: 54-68 |
| 15 | | Frantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005) |
| 2004 | ||
| 14 | | Frantisek Franek, William F. Smyth: Sorting suffixes of two-pattern strings. Stringology 2004: 69-78 |
| 2003 | ||
| 13 | | Frantisek Franek, Weilin Lu, William F. Smyth: Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003) |
| 12 | | Frantisek Franek, William F. Smyth, Yudong Tang: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 579-591 (2003) |
| 11 | | Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao: Computing Quasi Suffix Arrays. Journal of Automata, Languages and Combinatorics 8(4): 593-606 (2003) |
| 10 | | 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 | ||
| 9 | | Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth: Two-Pattern Strings. CPM 2002: 76-84 |
| 8 | | 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) |
| 7 | | 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 Cryptography 26(1-3): 243-256 (2002) |
| 6 | | Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa: Completing the spectrum of 2-chromatic S(2, 4, v). Discrete Mathematics 247(1-3): 225-228 (2002) |
| 2000 | ||
| 5 | | Ivan Bruha, Frantisek Franek, Vladimir L. Rosicky: The simulation of business rules in active databases using expert system approach. ESM 2000: 67-71 |
| 1997 | ||
| 4 | | Frantisek Franek, Alexander Rosa, Terry S. Griggs: Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. Des. Codes Cryptography 12(1): 59-67 (1997) |
| 1996 | ||
| 3 | | Ivan Bruha, Frantisek Franek: Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm. IJPRAI 10(8): 939-955 (1996) |
| 1993 | ||
| 2 | | Frantisek Franek, Vojtech Rödl: 2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. Discrete Mathematics 114(1-3): 199-203 (1993) |
| 1992 | ||
| 1 | | Frantisek Franek, Vojtech Rödl: Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. Graphs and Combinatorics 8(4): 299-308 (1992) |
| 1 | Andrew Baker | [27] |
| 2 | Ivan Bruha | [3] [5] [20] |
| 3 | Antoine Deza | [26] [27] |
| 4 | Mike J. Grannell | [7] |
| 5 | Terry S. Griggs | [4] [6] [7] |
| 6 | Jan Holub | [11] |
| 7 | Christopher G. Jennings | [17] [22] |
| 8 | Jiandong Jiang | [9] [21] |
| 9 | Mei Jiang | [25] [26] [28] |
| 10 | Charles Curtis Lindner (Charles C. Lindner) | [6] |
| 11 | Weilin Lu | [9] [13] |
| 12 | A. M. Paracha | [24] |
| 13 | Vojtech Rödl | [1] [2] |
| 14 | Alexander Rosa | [4] [6] [7] |
| 15 | Vladimir L. Rosicky | [5] |
| 16 | William F. Smyth (Bill Smyth) | [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [21] [22] |
| 17 | Yudong Tang | [12] |
| 18 | Xiangdong Xiao | [10] [11] |
| 19 | Qian Yang | [19] [23] |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page