Proceedings of conferences, workshops, or other meetings          Home

  1. F. Franek, A. Paracha and W.F. Smyth
    The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array
    Proceedings of Prague Stringology Conference PSC 2017, Prague, Czech Republic, August, 2017, pp 77-84
  2. F. Franek, A.S.M. Sohidull Islam, M. Sohel Rahman, and W.F. Smyth
    Algorithms to Compute the Lyndon Array
    Proceedings of Prague Stringology Conference PSC 2016, Prague, Czech Republic, August, 2016, 72-84
  3. H. Bai, F. Franek, and W. F. Smyth
    Two Squares Canonical Factorization
    Proceedings of Prague Stringology Conference PSC 2014, Prague, Czech Republic, September, 2014, 52-58
  4. A. Deza, F. Franek, and M. Jiang
    A Computational Framework for Determining Square-maximal Strings
    Proceedings of Prague Stringology Conference PSC 2012, Prague, Czech Republic, August, 2012, pp. 112-119 [pdf]
  5. S. Sharieh, F. Franek, and A. Ferworn
    Using Cloud Computing for Medical Applications SpringSim '12, 15th Communications and Networking Symposium, 2012
  6. F. Franek, M. Jiang, and C. Weng
    An improved version of the runs algorithm based on Crochemore's partitioning algorithm
    Proceedings of Prague Stringology Conference PSC 2011, Prague, Czech Republic, August 29-31, 2011,
    pp. 98-105
  7. A. Baker, A. Deza, and F. Franek
    A parameterized formulation for the maximum number of runs problem
    Proceedings of Prague Stringology Conference PSC 2011, Prague, Czech Republic, August 29-31, 2011,
    pp. 74-82
  8. A. Deza, F. Franek, and M. Jiang
    A d-step approach for distinct squares in strings
    Proceedings of 22nd Annual Symposium on Combinatorial Pattern Matching - CPM 2011, Palermo, ITALY,
    27-29 June 2011, Lecture Notes in Computer Science 6661 Springer-Verlag, Berlin (2011) 77 - 89.
  9. S. Sharieh, F. Franek, and A. Ferworn
    Mobile Medical Application Model for Heterogeneous Networks
    SpringSim '11, 14th Communications and Networking Symposium, 2011
  10. F. Franek and M. Jiang
    Crochemore's repetitions algorithm revisited - computing runs
    Proceedings of Prague Stringology Conference 2009, Prague, Czech Republic, August 31–September 2, 2009,
    pp. 123-128 [pdf]
  11. A.M. Paracha and F. Franek
    Testing Grammars for Top-Down parsers [pdf]
    Procedings of the International Joint Conferences on Computer, Information, and Systems Sciences, and
    Engineering (CIS2E 08),  Sponsored by the University of Bridgeport, December 5 - 13, 2008
  12. F. Franek and Q. Yang
    An asymptotic lower bound for the maximal-number-of-runs function
    Proceedings of Prague Stringology Conference 2006, Prague, Czech Republic, August 28-30, 2006, pp.3-9  [pdf]
  13. F. Franek and W.F. Smyth
    Reconstructing a suffix array
    Proceedings of Prague Stringology Conference 2005, Prague, Czech Republic, August 29-31, 2005, pp.54-68
    [ps] or [pdf]
  14. F. Franek, C. G. Jennings, and W.F. Smyth
    A simple fast hybrid Pattern-Matching Algorithm
    Proceedings of 16th Annual Symposium in Combinatorial Pattern Matching (CPM 2005), Jeju Island, Korea, June 2005,
    pp. 288-298, edited by A. Apostolico, M. Crochemore, and K. Park, Lecture Notes in Computer Science, Vol. 3537,
    Springer Verlag, 2005 [pdf]
  15. E.R.Sykes and F.Franek
    Presenting JECA: A Java Error Correcting Algorithm for the Java Intelligent Tutoring System
    Proceedings of Conference on Advances in Computer Science and Technologies, ACTS 2004, St. Thomas,
    US Virgin Islands, November 2004, ISBN: 0-88986-437-3 (ISBN (CD): 0-88986-439-X)
    [Abstract][pdf]
  16. F. Franek and W.F. Smyth
    Sorting suffixes of two-pattern strings
    Proceedings of the Prague Stringology Conference 2004, 69-78
    [ps] or [pdf]
  17. E.R.Sykes and F.Franek
    Presenting JECA: A Java Error Correcting Algorithm for the Java Intelligent Tutoring System
    Proceedings of the IASTED International Conference on Advances in Computer Science and Technology , St. Thomas, Virgin Islands,
    USA, pp. 151-156
  18. E.R.Sykes and F.Franek
    Preliminary Assessment of the Java Intelligent Tutoring System
    Proceedings of the International Conference on Education and Information
    Systems, Technologies and Applications Orlando, Florida, July 2004, pp.22-28 [pdf]
  19. E.R.Sykes and F.Franek
    Field-Report of the Java Intelligent Tutoring System
    Learning Technology Newsletter, Publication of IEEE Computer Society Technical Committee on Learning Technology
    (ISSN 1438-0625), pp. 32-35
  20. E.R.Sykes and F.Franek
    Pedagogical Design of the Java Intelligent Tutoring System
    Proceedings of the International Conference on Education and Information  Systems,
    Technologies and Applications Orlando, Florida, July 2004, pp.213-218.
  21. E.R. Sykes and F. Franek
    Inside the Java Intelligent Tutoring System Prototype: Parsing Student Code Submissions with
    Intent Recognition

    Proceedings of the IASTED International Conference on Computers and Advanced Technology in Education.
    Innsbruck, Austria, January 2004, pp. 613-618, [pdf]
  22. F. Franek, J. Simpson, and W.F. Smyth
    The maximum number of runs in a string
    Proceedings of AWOCA 2003, 14th Australasian Workshop on Combinatorial Algorithms,
    Seoul National University, Seoul, Korea, 13 - 16 July, 2003, [ps] or [pdf]
  23. E. R. Sykes and F. Franek
    A prototype for an Intelligent Tutoring System for students learning to program in Java
    Proceedings of CATE2003, IASTED International Conference on Computers and Advanced Technology
    in Education,
    June 30 - July 2, 2003, Rhodes, Greece,
    pp. 78-83, [ps] or [pdf]
  24. E.R. Sykes and F. Franek
    An Intelligent Tutoring System Prototype for Learning to Program Java
    Proceedings of the 3rd IEEE International Conference on Advanced Learning Technologies, Athens,
    Greece, July, 2003, pp. 485-486, [ps] or [pdf]
  25. I. Bruha and F. Franek
    Inducing Parameters of a Decision Tree for Expert System Shell McESE by Genetic Algorithm
    Proceedings of  ISC'2003 - International Industrial Simulation Conference, Universitat Politecnica
    de Valencia, Valencia, Spain, June 9-12, 2003,
    [ps] or [pdf]
  26. F. Franek, W.F. Smyth, and X. Xiao
    A note on Crochemore's repetitions algorithm, a fast space-efficient approach
    PSC 2002, Prague Stringology Conference, Prague, Czech Republic, September 22-23, 2002
    [ps] or [pdf]
  27. L. Baghdadi, F. Franek, W.F. Smyth, and X. Xiao
    Computing quasi suffix arrays
    Invited paper in Proceedings of  The Thirteenth Australasian Workshop on Combinatorial Algorithms
    (AWOCA 2002), Fraser Island, Australia, July 7-10, 2002, pp 279-296, ISBN  1 86499 638 2,
    edited by E. Billington, D. Donovan, A. Khodkar, [ps] or [pdf]
  28. F. Franek, W.F. Smyth, and Y. Tang
    Computing all repeats using suffix arrays
    Proceedings of  The Thirteenth Australasian Workshop on Combinatorial Algorithms
    (AWOCA 2002), Fraser Island, Australia, July 7-10, 2002 pp 171-184, ISBN  1 86499 638 2,
    edited by E. Billington, D. Donovan, A. Khodkar, [ps] or [pdf]
  29. F. Franek, J. Jiang,  W. Lu, and W.F. Smyth
    Two-Pattern Strings
    Proceedings of The Thirteenth Annual Symposium on Combinatorial Pattern Matching
    (CPM2002), Fukuoka, Japan, July 3-5, 2002, edited by A. Apostolico and M. Takeda
    Lecture Notes in Computer Science, Vol. 2373, Springer 2002, pp 76-84,
    [ps] or [pdf]
  30. F. Franek
    Erdös' conjecture on multiplicities of complete subgraphs
    Abstracts of the Graphs 2002, Rejviz, Czech Republic, May 2002
  31. F. Franek
    Erdös' conjecture revisited
    Abstracts of the 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
  32. F. Franek, W. Lu, and W.F. Smyth
    Repetitions in two-pattern strings
    Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Information,
    SCI 2001, July 22-25, 2001, Orlando, Florida, USA, [ps] or [pdf]
  33. F. Franek and I. Bruha
    Post-processing of qualities of decision rules within a testing phase
    Proceedings of KDD-2000, The Sixth ACM SIGKDD International Conference on Knowledge
    Discovery and Data Mining, Boston, Massachusetts, August 2000,  [ps] or [pdf]
  34. I. Bruha, F. Franek, and V.L. Rosicky
    The simulation of business rules in active databases using expert system approach
    ESM2000 - Simulation and Modeling: Enabler for a better quality of life, Proceedings of the
    14th European Simulation Multiconference, Ghent, Belgium, May 23-26, 2000, [ps] or [pdf]
  35. F.Franek,  W. Lu, and W.F. Smyth
    Repetitions in two-pattern strings
    Proceedings of the Prague Stringology Club Workshop '2000, MFSC 2000 Workshop,
    Bratislava, Slovakia, September 2-3, 2000, pp.32-48, [ps] or [pdf]
  36. F. Franek, W. Lu, P.J. Ryan, W.F. Smyth, Y. Sun, L. Yang
    Verifying a border array in linear time
    Proc. Tenth  Australasian Workshop on Combinatorial Algorithms (AWOCA), School of
    Computing, Curtin University of Technology, Perth, Australia, August 25-27, 1999,
    pp. 26-33, [ps] or [pdf]
  37. F. Franek, V.L. Rosicky, I. Bruha
    A hybrid-expert-system based tool for scheduling and decision support
    ESM'99 - Simulation and Modeling: A tool for the next millenium, Proceedings of the
    13th European Simulation Multiconference, Warsaw, Poland, June 1-4, 1999
    edited by H. Szczerbicka, Volume II, Section: Modeling of Manufacturing Processes,
    pp. 494-496, [ps] or [pdf]
  38. F. Franek, A. Karaman, and W.F. Smyth
    Repetitions in Sturmian Strings
    Proceedings Ninth Australasian Workshop on Combinatorial Algorithms (AWOCA), School of
    Computing, Curtin University of Technology, Perth, Australia, July 1998
  39. F. Franek
    Ramsey-Like Properties of Steiner Triple Systems
    Abstracts of Graphs 96 - the 31st Czech and Slovak Conference on Graph Theory and Combinatorics, Solan,
    Czech Republic, June 1996
  40. F.Franek and I.Bruha
    Simulation of Petri Nets in the Rule-based Expert System Shell McESE
    Proceedings of ESM-95 Modeling and Simulation, European Simulation Multiconference, Prague,
    Czech Republic, June 5-7, 1995, pp. 173-179, [ps] or [pdf]
  41. F. Franek and I. Bruha
    Simulation of Neural Networks in Expert System Environment McESE
    Proceedings of the 1991 European Simulation Multiconference, June, 17-19, 1991, The Panum Institute,
    Copenhagen, Denmark, edited by E. Mosekilde, pp. 73-78, [ps] or [pdf]
  42. F. Franek
    On Erdös' conjecture on multiplicities of subgraphs
    Abstracts of the 2nd Czechoslovak Symposium in Combinatorics, Prachatice, 1990
  43. I. Bruha and F. Franek
    Towards Sequential Structure-Processing Learning: Simulation of Forgetting/Retrieving Algorithm
    Proceedings of 1990 European Simulation Conference: ARTIFICIAL INTELLIGENCE AND SIMULATION,
    Nuremberg, Germany, June 1990, pp. 106-109, [ps] or [pdf]
  44. F. Franek and I. Bruha
    A way to incorporate Neural Networks into Expert Systems
    Proceedings of the IASTED International Symposium ARTIFICIAL INTELLIGENCE APPLICATION &
    NEURAL NETWORKS - AINN'90, Zurich, Switzerland, June 25-27, 1990, pp. 251-254, [ps] or [pdf]
  45. I. Bruha and F. Franek
    On a Knowledge-Based Model of Structure Learning: Methodology and Implementation
    Proceedings of the 1989 European Simulation Multiconference on Simulation Methodologies, Languages and
    Architectures and AI and Graphics for Simulation, Rome, Italy, June 7-9, 1989, pp. 149-154
    Ed. by G. Lazeolla, A. Lehmann, H.J. Van Den Herik
    fast view by pages or download (slow) zipped pdf file [rome89.pdf.zip]
  46. F. Franek and I. Bruha
    AN ENVIRONMENT FOR EXTENDING CONVENTIONAL PROGRAMMING LANGUAGES TO
    BUILD EXPERT SYSTEM APPLICATIONS

    Proceedings of the IASTED International Symposium on EXPERT SYSTEMS, THEORY & APPLICATIONS,
    Zurich, Switzerland, June 26-28, 1989, pp. 106-109, [ps] or [pdf]
  47. F. Franek and I. Bruha
    McESE - McMASTER EXPERT SYSTEM ENVIRONMENT
    ICCI'89 - Proceedings of the International Conference on Computing and Information,
    Toronto, Canada, May 23-27, 1989, edited by R. Janicki and W. Koczkodaj
    in Computing and Information, North-Holland 1989, pp. 383-388, [ps] or [pdf]
  48. F. Franek
    McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP
    ICCI'89 - Proceedings of the International Conference on Computing and Information,
    Toronto, Canada, May 23-27, 1989, edited by R. Janicki and W. Koczkodaj
    in Computing and Information, North-Holland 1989, pp. 379-382, [ps] or [pdf]
  49. F. Franek
    Saturated Ideals Obtained via Restricted Iterated Collapse of Huge Cardinals
    in Set Theory and its Applications (ed. J. Steprans, S. Watson), Lecture Notes in Mathematics,
    No. 1401, Springer-Verlag, 1989, pp. 73-96,  [ps] or [pdf]
  50. F. Franek and V. Rödl
    Disapproving Erdös' Conjecture using computers
    Abstracts of the Joint French-Israeli Binational Symposium on Combinatorics and Algorithms,
    Jerusalem, Israel, November 1988
  51. F. Franek
    Saturated Ideals and Generic Ultrapowers
    Abstracts of the International Conference on Set Theory and Boolean Algebras, German National
    Mathematical Institute in Oberwolfach, Oberwolfach, West Germany, January 1985
  52. B. Balcar and F. Franek
    Independent families on complete Boolean algebras
    (ed. Z. Frolik) Abstracts of the 7th Winter School in Abstract Analysis,Math. Institute of
    Czechoslovak Academy of Science, Prague, Czech Republic, February 1979, pp. 10-14