default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrantisek Franek
Person information
- affiliation: Department of Computing and Software, McMaster University, Hamilton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j33]Frantisek Franek, Michael Liut
:
Computing Maximal Lyndon Substrings of a String. Algorithms 13(11): 294 (2020)- 2018
- [j32]Jacqueline W. Daykin, Frantisek Franek, Jan Holub, A. S. M. Sohidull Islam, W. F. Smyth:
Reconstructing a string from its Lyndon arrays. Theor. Comput. Sci. 710: 44-51 (2018) - 2017
- [j31]Antoine Deza, Frantisek Franek:
Bannai et al. method proves the d-step conjecture for strings. Discret. Appl. Math. 217: 488-494 (2017) - 2016
- [j30]Haoyue Bai, Frantisek Franek, William F. Smyth:
The New Periodicity Lemma revisited. Discret. Appl. Math. 212: 30-36 (2016) - [j29]Antoine Deza, Frantisek Franek, Mei Jiang:
A computational substantiation of the d-step approach to the number of distinct squares problem. Discret. Appl. Math. 212: 81-87 (2016) - [j28]Haoyue Bai, Antoine Deza, Frantisek Franek:
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]. J. Discrete Algorithms 38-41: 50-51 (2016) - 2015
- [j27]Antoine Deza, Frantisek Franek, Adrien Thierry:
How many double squares can a string contain? Discret. Appl. Math. 180: 52-69 (2015) - [j26]Haoyue Bai, Antoine Deza, Frantisek Franek:
On a lemma of Crochemore and Rytter. J. Discrete Algorithms 34: 18-22 (2015) - 2014
- [j25]Antoine Deza, Frantisek Franek:
A d-step approach to the maximum number of distinct squares and runs in strings. Discret. Appl. Math. 163: 268-274 (2014) - 2013
- [j24]Andrew Baker, Antoine Deza, Frantisek Franek:
A computational framework for determining run-maximal strings. J. Discrete Algorithms 20: 43-50 (2013) - 2012
- [j23]Frantisek Franek, Mei Jiang:
Crochemore's Repetitions Algorithm Revisited: Computing Runs. Int. J. Found. Comput. Sci. 23(2): 389-401 (2012) - [j22]Andrew Baker, Antoine Deza, Frantisek Franek:
On the structure of run-maximal strings. J. Discrete Algorithms 10: 10-14 (2012) - [j21]Frantisek Franek, Robert C. G. Fuller, Jamie Simpson, William F. Smyth:
More results on overlapping squares. J. Discrete Algorithms 17: 2-8 (2012) - [j20]Antoine Deza, Frantisek Franek, Min Jing Liu:
On a conjecture of Erdős for multiplicities of cliques. J. Discrete Algorithms 17: 9-14 (2012) - 2008
- [j19]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
- [j18]Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A simple fast hybrid pattern-matching algorithm. J. Discrete Algorithms 5(4): 682-695 (2007) - [j17]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
- [j16]Frantisek Franek, William F. Smyth:
Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006) - 2005
- [j15]Frantisek Franek, William F. Smyth:
Sorting suffixes of two-pattern strings. Int. J. Found. Comput. Sci. 16(6): 1135-1144 (2005) - 2003
- [j14]Frantisek Franek, William F. Smyth, Yudong Tang:
Computing all Repeats Using Suffix Arrays. J. Autom. Lang. Comb. 8(4): 579-591 (2003) - [j13]Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao:
Computing Quasi Suffix Arrays. J. Autom. Lang. Comb. 8(4): 593-606 (2003) - [j12]Frantisek Franek, Weilin Lu, William F. Smyth:
Two-pattern strings I - A recognition algorithm. J. Discrete Algorithms 1(5-6): 445-460 (2003) - [j11]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
- [j10]Frantisek Franek:
On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6. Comb. 22(3): 451-454 (2002) - [j9]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 Cryptogr. 26(1-3): 243-256 (2002) - [j8]Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa:
Completing the spectrum of 2-chromatic S(2, 4, v). Discret. Math. 247(1-3): 225-228 (2002) - 2001
- [j7]Frantisek Franek, Dalibor Froncek, Alexander Rosa:
Imbalance in tournament designs. Australas. J Comb. 23: 237-252 (2001) - 2000
- [j6]Frantisek Franek, Ayse Karaman, W. F. Smyth:
Repetitions in Sturmian strings. Theor. Comput. Sci. 249(2): 289-303 (2000) - 1997
- [j5]Frantisek Franek, Alexander Rosa, Terry S. Griggs:
Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. Des. Codes Cryptogr. 12(1): 59-67 (1997) - [j4]Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa:
Triangles in 2-factorizations. J. Graph Theory 26(2): 83-94 (1997) - 1996
- [j3]Ivan Bruha, Frantisek Franek:
Comparison of Various Routines for Unknown Attribute Value Processing The Covering Paradigm. Int. J. Pattern Recognit. Artif. Intell. 10(8): 939-955 (1996) - 1993
- [j2]Frantisek Franek, Vojtech Rödl:
2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs. Discret. Math. 114(1-3): 199-203 (1993) - 1992
- [j1]Frantisek Franek, Vojtech Rödl:
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. Graphs Comb. 8(4): 299-308 (1992)
Conference and Workshop Papers
- 2021
- [c22]Frantisek Franek, Michael Liut:
Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited. Stringology 2021: 41-52 - 2019
- [c21]Frantisek Franek, Michael Liut:
Algorithms to Compute the Lyndon Array Revisited. Stringology 2019: 16-28 - 2018
- [c20]Frantisek Franek, Michael Liut, William F. Smyth:
On Baier's Sort of Maximal Lyndon Substrings. Stringology 2018: 63-78 - 2017
- [c19]Frantisek Franek, Asma Paracha, William F. Smyth:
The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array. Stringology 2017: 77-84 - 2016
- [c18]Frantisek Franek, A. S. M. Sohidull Islam, Mohammad Sohel Rahman, William F. Smyth:
Algorithms to Compute the Lyndon Array. Stringology 2016: 172-184 - 2014
- [c17]Frantisek Franek:
On the Number of Distinct Squares. Stringology 2014: 1-2 - [c16]Haoyue Bai, Frantisek Franek, William F. Smyth:
Two Squares Canonical Factorization. Stringology 2014: 52-58 - 2012
- [c15]Antoine Deza, Frantisek Franek, Mei Jiang:
A Computational Framework for Determining Square-maximal Strings. Stringology 2012: 111-119 - 2011
- [c14]Antoine Deza, Frantisek Franek, Mei Jiang:
A d-Step Approach for Distinct Squares in Strings. CPM 2011: 77-89 - [c13]Andrew Baker, Antoine Deza, Frantisek Franek:
A Parameterized Formulation for the Maximum Number of Runs Problem. Stringology 2011: 74-82 - [c12]Frantisek Franek, Mei Jiang, Chia-Chun Weng:
An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm. Stringology 2011: 98-105 - 2009
- [c11]Frantisek Franek, Mei Jiang:
Crochemore's Repetitions Algorithm Revisited - Computing Runs. Stringology 2009: 214-224 - 2008
- [c10]A. M. Paracha, Frantisek Franek:
Testing Grammars For Top-Down Parsers. SCSS (1) 2008: 451-456 - 2006
- [c9]Ivan Bruha, Frantisek Franek:
The Way of Adjusting Parameters of the Expert System Shell McESE: New Approach. PRIS 2006: 119-126 - [c8]Frantisek Franek, Qian Yang:
An asymptotic lower bound for the maximal-number-of-runs function. Stringology 2006: 3-8 - 2005
- [c7]Frantisek Franek, Christopher G. Jennings, William F. Smyth:
A Simple Fast Hybrid Pattern-Matching Algorithm. CPM 2005: 288-297 - [c6]Frantisek Franek, William F. Smyth:
Reconstructing a suffix array. Stringology 2005: 54-68 - 2004
- [c5]Frantisek Franek, William F. Smyth:
Sorting suffixes of two-pattern strings. Stringology 2004: 69-78 - 2002
- [c4]Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth:
Two-Pattern Strings. CPM 2002: 76-84 - [c3]Frantisek Franek, William F. Smyth, Xiangdong Xiao:
A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach. Stringology 2002: 56-43 - 2000
- [c2]Ivan Bruha, Frantisek Franek, Vladimir L. Rosicky:
The simulation of business rules in active databases using expert system approach. ESM 2000: 67-71 - [c1]Frantisek Franek, Weilin Lu, William F. Smyth:
Repetitions in two-pattern strings. Stringology 2000: 32-48
Informal and Other Publications
- 2016
- [i1]Frantisek Franek, A. S. M. Sohidull Islam, M. Sohel Rahman, William F. Smyth:
Algorithms to Compute the Lyndon Array. CoRR abs/1605.08935 (2016)
Coauthor Index
aka: W. F. Smyth
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-08 00:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
