Talks and Presentations (the speaker's name  is underlined)         Home

1. F. Franek d-step approach to periodical structures in strings
   Conference Celebrating Alex Rosa's 80 birthday AR 80, Mikulov, Czech Republic, June 72- July 1, 2017
2. F. Franek d-step approach to periodical structures in strings
   The 6th biennial Canadian Discrete and Algorithmic Mathematics Conference CanaDAM 2017, Ryerson University, Toronto, June 12-15, 2017
3. F. Franek and B. Smyth Unexpected Equivalence: Lyndon Array & Suffix Array
   London Stringology Day LSD 2017, King's College, London, UK, Februray 9-10, 2017
4. F. Franek Algorithms to compute the Lyndon array
   Prague Stringology Conference PSC 2016, Prague, Czech Republic, Aug 29-31, 2016
   
5. F. Franek Lyndon factors and periodicities in strings [pdf]
   AdvOL invited seminar series, McMaster University, Hamilton,  April 19, 2016
6. F. Franek The d-step conjecture for runs verified  
   Seminar, Department of Computer Science, University of Auckland, Auckland, new Zealand, April 15, 2015
7. F. Franek The d-step conjecture for runs verified
   Seminar, School of Information Technology, University of Sydney, Sydnye, Australia, March 31, 2015
8. F. Franek How many double squares can a string contain?
   CCWA Lwecture Series, Centre for Combinatorics on Worda and Applications, Murdoch University, Perth, Australia, March 24, 2015
9. F. Franek How many double squares can a string contain?
   Colloqium of Computer Science department, Bar Ilan University, Tel Aviv, Israel, March 12, 2015
10. F. Franek, invited talk, On the Number of Distinct Squares
    Prague Stringology Conference PSC 2014, Prague, Czech Republic, Sep 1-3, 2014
11. H. Bai, F. Franek, and W.F. Smyth, Two squares canonical factorization
    Prague Stringology Conference PSC 2014, Prague, Czech Republic, Sep 1-3, 2014
12. A. Deza and F. Franek, How many double squares can a string contain? [pdf]
    ORCAS seminar, Departmen of Mathematics and Statistics, University of Guelph, March 2014
13. A. Deza and F. Franek, How many double squares can a string contain? [pdf]
    Séminaire d'algorithmique et de complexité du plateau de Saclay, February 2014
14. A. Deza and F. Franek, How many double squares can a string contain? [pdf]
    Laboratoire d'Informatique Gaspard-Monge, Université Paris-Est Marne-la-Vallée, February, 2014
15. A. Deza and F. Franek, How many double squares can a string contain? [pdf]
    AdvOL invited seminar series, McMaster University, Hamilton,  October 22, 2013
16. A. Deza and F. Franek, On the singularities of extremal periodic strings,
    Mini symposium: Eric Mendelsohn: Colleagues and Descendants. The 4th biennial Canadian Discrete and Algorithmic
    Mathematics Conference (CanaDAM 2013), Memorial University, St John’s, Newfoundland, June 2013
17. A. Deza and F. Franek, On the singularities of extremal periodic strings, Workshop on Challenges in Combinatorics on Words,
    Fields Institute, April 22-26, 2013
18. F. Franek, Maximum number of distinct squares problem,
    StringMasters workshop 2012, University of Verona, Verona, Italy, February 2012
19. A. Deza and F. Franek, d-step approach to distinct squares problem,
    StringMasters workshop 2013, Czech Technical University, Prague, Czech Republic, September 2013
20. A. Baker, A. Deza, and F. Franek, A computational framework for determining run-maximal strings [pdf]
    London Stringology Days/London Algorithmic Workshop 2012, LSD & LAW 2012, King's College,
    London, UK, February 9-10, 2012
21. F. Franek, M. Jiang, and C. Weng, An improved version of the runs algorithm based on Crochemore's partitioning algorithm
    Prague Stringology Conference PSC 2011, Prague, Czech Republic, August 29-31, 2011
22. A. Baker, A. Deza, and F. Franek, A parameterized formulation for the maximum number of runs problem
    Prague Stringology Conference PSC 2011, Prague, Czech Republic, August 29-31, 2011
23. A. Deza, F. Franek, and M. Jiang, A d-step approach for distinct squares in strings [pdf]
    22nd Annual Symposium on Combinatorial Pattern Matching - CPM 2011, Palermo, ITALY, 27-29 June 2011
24. A. Deza and F. Franek, d-step approach to the maximum-number-of-runs conjecture
    Stringology 2010 workshop (Invited keynote speaker), Bar-Ilan University, Ramat Gan, Israel, May 2-6, 2010.
25. F. Franek, A note on the structure of run-maximal strings
    London Stringology Days 2010, King’s College London, February 4-5, 2010
26. F. Franek and M. Jiang, Crochemore's repetitions algorithm revisited - computing runs
    Prague Stringology Conference 2009, Prague, Czech Republic, August 31-Sept. 4, 2009
27. A. Baker, A. Deza, and F. Franek, A note on the structure of run-maximal strings [pdf]
    African Stringmasters, Stellenbosch University, Stellenbosch, South Africa, July 27-31, 2009
28. F. Franek and V. Rodl, Erdos' conjecture on multiplicities of complete subgraphs for nearly quasirandom graphs [pdf]
    CORS-INFORMS International Conference, Toronto, June 14-17, 2009
29. F. Franek, Suffix-based text indices, construction algorithms, and applications [pdf]
    2nd Canadian Discrete and Algorithmic Mathematics Conference - CanaDAM 2009,
    Centre de recherches mathematiques in Montreal, Quebec, Canada, May 25-28, 2009
30. F. Franek and M. Jiang, Crochemore’s algorithm for repetitions revisited - computing runs [pdf]
    The 4th Stringology Research Workshop,  Bar-Ilan University, Ramat Gan, Israel., March 29 - April 2, 2009
31. A.M. Paracha and F. Franek, Testing Grammars For Top Down Parsers [ppt]
    International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE 08),
    December 5 - 13, 2008, see http://www.cisse2008online.org/
32. F. Franek, Compiler Optimization [pdf]
    AdvOL invinted smeninar, Dept. of Comp. and Soft., McMaster University, Hamilton, Ontario, April 28, 2008
33. F. Franek and J. Holub, A simpler proof of Crochemore-Ilie lemma concerning maximum number of runs in a string [pdf]
    London Algorithmic Workshop LAW2008, King's College, London, UK, Februry 2008
34. F. Franek, Q. Yang, On a lower bound for the maximum number of runs [pdf]
    London Algorithmic Workshop LAW2007, King's College, London,UK, February 2007
35. F. Franek, Q. Yang, An asymptotic lower bound for the maximal-number-of-runs function
    Prague Stringology Conference 2006, Prague, Czech Republic, August 2006
36. F. Franek, W.F. Smyth, Reconstructing the suffix array  [pdf]
    Prague Stringology Conference 2005, Prague, Czech Republic, August 2005
37. F. Franek, C. G. Jennings, and W.F. Smyth, A simple fast hybrid Pattern-Matching Algorithm
    CPM 2005, Jeju Island, Korea, June 2005
38. F. Franek, C. G. Jennings, and W.F. Smyth, A simple fast hybrid Pattern-Matching Algorithm
    LSD’05, King’s College, London, UK, February 2005
39. F. Franek, W.F. Smyth, Reconstructing the suffix array  [pdf]
    LSD’05, King’s College, London, UK, February 2005
40. F. Franek, W.F. Smyth, Reconstructing the suffix array  [pdf]
    ARG seminar, Dept. of Computing and Software, McMaster University, Hamilton,
    Ontario, January 2005
41. F. Franek, W.F. Smyth, Sorting suffixes of two-pattern strings  (html slides) [pps]
    Prague Stringology Conference 2004, Prague, Czech Republic, August 2004
42. F. Franek
    Suffixes and Prefixes of strings [pdf]
    School of Computing, Curtin University, Perth, Western Australia, Australia, April, 2004
43. F. Franek, Suffixes and Prefixes of strings [pdf]
    School of ITMS, University of Ballarat, Victoria, Australia, April, 2004
44. F. Franek, W.F. Smyth, Quasi-suffix arrays  (html slides)
    LSD'03 Workshop - London Stringology Day, King's College, London, UK, February, 2003
45. F. Franek, J. Simpson, and W.F. Smyth, The maximum number of runs in a string (html slides)
    LSD'03 Workshop - London Stringology Day, King's College, London, UK, February, 2003
46. F. Franek, W.F. Smyth, and X. Xiao, A note on Crochemore's repetitions algorithm, a fast space-efficient approach [ps, pdf]
    PSC 2002, Prague Stringology Conference, Prague, Czech Republic, September 22-23, 2002
    
47. F. Franek and W.F. Smyth, A fast space-efficient implementation of Crochemore repetitions algorithm[ppt]
    Seminar, Dept. of Comp. Sci., National University of Singapore, Singapore, July 2002
48. L. Baghdadi, F. Franek, W.F. Smyth, X. Xiao, Computing quasi suffix arrays [ps, pdf]
    Invited talk at AWOCA 2002, Fraser Island, Australia, July 7-10 2002,
49. F. Franek, W.F. Smyth, Y. Tung, Computing all repeats using suffix arrays [ps, pdf]
    Talk at AWOCA 2002, Fraser Island, Australia, July 7-10 2002
50. F. Franek, J. Jiang, W. Lu, and W.F. Smyth, Two-Pattern Strings [ps, pdf]
    Talk at CPM 2002, Fukuoka, Japan, July 2002, 
51. C. Iliopoulos, C. Makris, S. Sioutas, A. Tsakalidis, and K. Tsichlas -- preseneted by F. Franek
    Identifying occurrences of maximal pairs in multiple strings
    Talk at CPM 2002, Fukuoka, Japan, July 2002
52. F. Franek, Erdos's conjecture on multiplicities of complete subgraphs [ps, pdf]
    Invited talk at Graphs 2002, Rejviz, Czech Republic, May 2002
53. F. Franek, A fast space-efficient implementation of Crochemore repetitions algorithm [ppt]
    Seminar, Dept. of Computing and Software, McMaster Unievsrity, Hamilton,Ontario, November 2001
54. F. Franek, Erdos's conjecture revisited (html slides)
    Summer 2001 Workshop on Graphs and Combinatorial Designs, University of Hawaii, Honolulu,
    Hawaii, July 13-27, 2001
55. F. Franek, Erdos's conjecture revisited [ppt]
    Czech and Slovak Conference on Graph Theory and Combinatorics, Institute for Theoretical Computer
    Science of Charles University, Sedmihorky Spa, Czech Republic, June 4-8 2001
56. F.Franek,  W. Lu, and W.F. Smyth
    Repetitions in two-pattern strings (html slides)
    LSD'00 Workshop - London Stringology Day, King's College, London, UK, December, 2000
57. F. Franek and I. Bruha
    Post-processing of qualities of decision rules within a testing phase
    KDD-2000, The Sixth ACM SIGKDD International Conference on Knowledge
    Discovery and Data Mining, Boston, Massachusetts, August 2000
58. I. Bruha, F. Franek, and V.L. Rosicky
    The simulation of business rules in active databases using expert system approach (html slides)
    ESM2000 - Simulation and Modeling: Enabler for a better quality of life,
    14th European Simulation Multiconference, Ghent, Belgium, May 23-26, 2000, [ps] or [pdf]
59. F.Franek,  W. Lu, and W.F. Smyth
    Repetitions in two-pattern strings (html slides)
    Prague Stringology Club Workshop '2000, MFSC 2000 Workshop, Bratislava,
    Slovakia, September 2-3, 2000
60. B. Balcar and F. Franek
    Properties of Boolean algebras related to Maharam's problems
    Center For Theoretical Study, Prague, Czech Republic, December 1999
61. F. Franek
    Generalization of Sturmian strings
    ARG Seminar, ARG, McMaster University, Hamilton, October 1999
62. F. Franek, W. Lu, P.J. Ryan, W.F. Smyth, Y. Sun, L. Yang
    Verifying a border array in linear time
    Tenth  Australasian Workshop on Combinatorial Algorithms (AWOCA), School of
    Computing, Curtin University of Technology, Perth, Australia, August 25-27, 1999
63. F. Franek, A. Karaman, and W.F. Smyth
    Repetitions in Sturmian Strings (html slides)
    Workshop on Graphs and Combinatorial Designs, University of Hawaii, Honolulu,
    Hawaii, July 1999
64. F. Franek, V.L. Rosicky, I. Bruha
    A hybrid-expert-system based tool for scheduling and decision support (html slides)
    ESM'99 - Modeling and Simulation: A tool for the next millenium, P
    13th European Simulation Multiconference, Warsaw, Poland, June 1-4, 1999, [ppt]
65. F. Franek, A. Karaman, and W.F. Smyth
    Repetitions in Sturmian Strings
    Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA), School of
    Computing, Curtin University of Technology, Perth, Australia, July 1998
66. F. Franek
    On Ramsey Properties of Steiner Triple Systems, Finite and Infinite Case
    The Center For Theoretical Study, Prague, Czech Republic, July 1998
67. F. Franek
    Erdos's conjecture on multiplicities of complete subgraphs revisited
    Seminar, Dept. of Comp. Sci. and Systems, McMaster University, Hamilton, March 1997
68. F. Franek
    Projective Steiner Triple Systems (html slides)
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, January 1997
69. B.Balcar and F. Franek
    Structural Properties of Universal Minimal Dynamical Systems for Discrete Semigroups (html slides)
    Colloquium, Dept. of Mathematics and Comp.Sci., Dartmouth College, Hanover, New Hampshire,
    December 1996
70. F. Franek
    Ramsey-Like Properties of Steiner Triple Systems (html slides)
    Graphs 96 - the 31st Czech and Slovak Conference on Graph Theory and Combinatorics, Solan,
    Czech Republic, June 1996
71. F. Franek
    Ramsey-Like Properties of Steiner Triple Systems
    Dept. of Mathematics, University of Puerto Rico, San Juan, Puerto Rico, April 1996
72. F. Franek
    Dynamical Systems
    Seminar, Dept. of Mathematics, York University, Toronto, Ontario, March 1996
73. F.Franek
    Unix programming - Issues and Techniques (html slides)
    Seminar, Dept. of Comp. Sci. and Systems, McMaster University, Hamilton, February 1996
74. F. Franek
    Ramsey Properties of Steiner Systems
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, October 1995
75. F. Franek
    Dynamical Systems
    Workshop on Set Theory to Commemorate Prof. Vopenka's 60th Birthday, Charles University,
    Prague, 1995
76. F.Franek and I.Bruha
    Simulation of Petri Nets in the Rule-based Expert System Shell McESE
    ESM-95 Modeling and Simulation, European Simulation Multiconference, Prague,
    Czech Republic, June 5-7, 1995
77. F. Franek
    Universal minimal dynamical systems and complete Boolean Algebras
    Set Theory Seminar, Dept. of Math., Pennsylvania State University, State College, Pennsylvania,
    December 1994
78. F. Franek
    Dynamical Systems and Boolean Algebras
    Set Theory Seminar, Dept. of Math., University of Toronto, Toronto, Ontario, April 1994
79. F. Franek
    Dynamical Systems and Boolean Algebras
    Set Theory Seminar, Dept. of Math., University of Toronto, Toronto, Ontario, January 1994
80. F. Franek
    Topological Dynamics
    Academic Katetov's seminar, Charles University, Prague, a series of 3 talks in October-November 1993
81. F. Franek
    Universal Minimal Dynamical Systems for Semi-Groups and Cohen Algebras
    The Center For Theoretical Study, Prague, Czech Republic, a series of talks in June 1993
82. F. Franek
    Some Combinatorial Results via Dynamic Systems (html slides)
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, February 1993
83. F. Franek
    The non-existence of universal Steiner triple systems
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, October 1992
84. F. Franek
    Topological Dynamical Systems
    Colloquium, Dept. of Math. and Comp. Sci., Emory University, Atlanta, Georgia, April 1992
85. F. Franek
    Introduction to Forcing
    Logic Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, March 1992
86. F. Franek
    Dynamical Systems and Boolean Algebras
    Set-theory Seminar, Dept. of Math., University of Toronto, Toronto, Ontario, February 1992
87. F. Franek
    Topological Dynamical Systems and Boolean Algebras (html slides)
    Colloquium, Dept. of Mathematics, McMaster University, Hamilton, January 1992
88. F. Franek
    Some Ramsey Properties of Steiner Systems (html slides)
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, October 1991
89. F. Franek and I. Bruha
    Simulation of Neural Networks in Expert System Environment McESE (html slides)
    ESM'91 - European Simulation Multiconference, June, 17-19, 1991, The Panum Institute, Copenhagen,
    Denmark
90. F. Franek
    Dynamical Systems
    The Center For Theoretical Study, Prague, Czech Republic, a series of talks in June 1991
91. F. Franek
    Some Combinatorial Aspects of Dynamical Systems
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, March 1991
92. F. Franek
    Ramsey-like Properties of Steiner Triple Systems
    Combinatorics Seminar, Dept. of Math. and Stat., McMaster University, Hamilton, October 1990
93. F. Franek
    On Erdos's conjecture on multiplicities of subgraphs
    2nd Czechoslovak Symposium in Combinatorics, Prachatice, 1990
94. I. Bruha and F. Franek
    Towards Sequential Structure-Processing Learning: Simulation of Forgetting/Retrieving Algorithm
    1990 European Simulation Conference: ARTIFICIAL INTELLIGENCE AND SIMULATION,
    Nuremberg, Germany, June 1990
95. F. Franek and I. Bruha
    A way to incorporate Neural Networks into Expert Systems (Slide)
    IASTED International Symposium ARTIFICIAL INTELLIGENCE APPLICATION & NEURAL
    NETWORKS - AINN'90, Zurich, Switzerland, June 25-27, 1990
96. I. Bruha and F. Franek
    On a Knowledge-Based Model of Structure Learning: Methodology and Implementation
    1989 European Simulation Multiconference on Simulation Methodologies, Languages and
    Architectures and AI and Graphics for Simulation, Rome, Italy, June 7-9, 1989
97. F. Franek and I. Bruha
    AN ENVIRONMENT FOR EXTENDING CONVENTIONAL PROGRAMMING LANGUAGES
    TO BUILD EXPERT SYSTEM APPLICATIONS (html slides)
    IASTED International Symposium on EXPERT SYSTEMS, THEORY & APPLICATIONS, Zurich,
    Switzerland, June 26-28, 1989
98. F. Franek
    On multiplicities of complete subgraphs in graphs and their complements
    Second Cumberland Conference on Applications of Graph Theory to Computer Science,
    Memphis, Tennessee, May 1989
99. F. Franek and I. Bruha
    McESE - McMASTER EXPERT SYSTEM ENVIRONMENT (html slides)
    ICCI'89 - International Conference on Computing and Information,
    Toronto, Canada, May 23-27, 1989
100. F. Franek
     McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP (html slides)
     ICCI'89 - International Conference on Computing and Information,
     Toronto, Canada, May 23-27, 1989
101. F. Franek
     On Erdos's conjecture related to Ramsey theorem
     Colloquium, Dept. of Math., York University, Toronto, Ontario, February 1989
102. F. Franek
     On Erdos's conjecture related to Ramsey theorem
     Fourth Ontario Combinatorics Workshop, Queen's University, Kingston, Ontario, April 1989
103. F. Franek and V. Rodl
     Disapproving Erdos Conjecture using computers
     The Joint French-Israeli Binational Symposium on Combinatorics and Algorithms, Jerusalem, Israel,
     November 1988
104. F. Franek
     A conjecture of Erdos
     Combinatorics Seminar, McMaster University, Hamilton, Ontario, October 1988
105. F. Franek
     Using computers in graph theory
     Dept. of Math. and Comp. Sci., Emory University, Atlanta, Georgia, May 1988
106. F. Franek
     Disapproving a conjecture of Erdos using computers
     Department d'informatique er de recherche operationelle, Universite de Montreal, Montreal, Quebec,
     April 1988
107. F. Franek
     McESE Project  (html slides)
     Department d'informatique er de recherche operationelle, Universite de Montreal, Montreal, Quebec,
     April 1988
108. F. Franek
     Isomorphisms of Steiner Triple Systems and Anti-Pasch Systems
     Third Ontario Combinatorics Workshop, University of Waterloo, Waterloo, Ontario, November 1987
109. F. Franek
     McMaster Expert System Extension of C
     Seminar, Dept. of Comp. Sci. and Systems, McMaster University, Hamilton, Ontario, October 1987
110. F. Franek
     Isomorphisms of Sterner Triple Systems
     Combinatorics Seminar, McMaster University, Hamilton, Ontario, October 1987
111. F. Franek
     Steiner Triple Systems
     STACEY International conference on Set theory, University of Toronto, Toronto, Ontario, June 1987
112. F. Franek
     Some combinatorial results of complete Boolean algebras
     Colloquium, Dept. of Math. and Stat., McMaster University, Hamilton, Ontario, February 1987
113. F. Franek
     Belief networks with locally computable uncertainty (html slides)
     Seminar, Dept. of Comp. Sci. and Systems, McMaster University, Hamilton, Ontario, October 1986
114. F. Franek
     Expert systems and reasoning with uncertainty (html slides)
     recruiting talk, McMaster University, Toronto, Ontario,  March 1986
115. F. Franek
     Expert systems and reasoning with uncertainty (html slides)
     recruiting talk, York University, Toronto, Ontario,  March 1986
116. F. Franek
     Temporal Logic Systems for Reasoning Involving Planning
     AI seminar, Dept. of Comp.Sci., Columbia University, New York, New York, March 1986
117. F. Franek
     Expert Systems built in COSC82 (html slides)
     recruiting talk, Columbia University, New York, New York,  April 1985
118. F. Franek
     Expert Systems built in COSC82 (html slides)
     recruiting talk, DePaul University, Chicago, Illinois, April 1985
119. F. Franek
     Expert Systems built in COSC82 (html slides)
     lecture for CIS, Dartmouth College, Hanover, New Hampshire, March 1985
120. F. Franek
     Saturated Ideals and Generic Ultrapowers
     International Conference on Set Theory and Boolean Algebras, German National Mathematical
     Institute in Oberwolfach, Oberwolfach, West Germany, January 1985
121. F. Franek
     Saturated Ideals and Set Theory
     Colloquium, Dartmouth College, Hanover, New Hampshire, 1984
122. F. Franek
     Collapsing a Huge cardinal
     Logic seminar, University of Toronto, Toronto, Ontario, July 1984
123. F. Franek
     Saturated Ideals and Large cardinals
     A series of talks at New England Set Theory Seminar (NESTS), Fall 1983
124. F. Franek
     Independent families on complete Boolean algebras
     Pennsylvania State University, State College, Pennsylvania, September 1980
125. F.Franek
     Completion of Powersets modulo ideals
     International SETOP conference, University of Toronto, Toronto, Ontario, 1980
126. B.Balcar and F.Franek
     Independent families on complete Boolean algebras
     7th Winter School in Abstract Analysis, Math. Institute of Czechoslovak Academy of Science, Prague,
     Czech Republic, February 1979
127. B.Balcar and F.Franek
     Semifree Boolean Algebras (html slides)
     Set Theory Conference, Union College, Schenectady, New York, 1979