The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frantisek Franek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  16. Crochemore's Repetitions Algorithm Revisited - Computing Runs. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002