Filip Šimek, C++ Library of Data Compression Algorithms (graduated in June 2009, Dean's Prize for Excellent Diploma Thesis awarded)
Jakub Jaroš, Word-based Dictionary Data Compression Methods (graduated in June 2008)
Martin Kočica, Comparison of Losless Data Compression Algorithms (graduated in June 2008)
Petr Procházka, Word-based Statistical Data Compression Methods (graduated in June 2008, Dean's Prize for Excellent Diploma Thesis awarded)
Tomáš Lakatos, FM-Index Implementation (graduated in February 2008)
Stanislav Štekr, Simulation of Finite Automata on Parallel Computers (graduated in February 2008)
Petr Abraham, Library for Indexing Structures (graduated in June 2007)
Martin Fiala, Implementation of DCA Compression Method (graduated in June 2007, Dean's Prize for Excellent Diploma Thesis awarded, 4.-5. place in IT Master Thesis of the Year competition)
Pavel Vedra, Finite Automata Manipulation Tool (graduated in June 2007)
Tomáš Kadlec, Deterministic State Cache (graduated in February 2007)
Tomáš Mlčoch, Evolutive Pattern Retrieval using Suffix Automaton (graduated in February 2007)
Milan Kynzl, NFA Simulation with Fail Function (graduated in June 2006)
Zuzana Škodová, Evolutive Pattern Matching (graduated in February 2006, Dean's Prize for Excellent Diploma Thesis awarded)
Petr Špiller, Selection of Optimum Simulation Method (graduated in February 2004)
Bc. students
Jan Opravil, Editor of Phraseology Dictionary (graduated in September 2008)
Holub J., Štekr S.: On Parallel Implementation of Deterministic Finite Automata. In S. Maneth (ed.): Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA2009), University of New South Wales, Sydney, Australia, LNCS5642, Springer-Verlag, pp. 54-64, 2009.
Fiala, M., Holub, J.: DCA using Suffix Arrays. In J. A. Storer,
M. W. Marcellin (eds.): Proceedings of Data Compression Conference 2008, IEEE Computer Society Press, p. 516, 2008.
2007
Holub, J., Smyth, W. F., Wang, S.: Hybrid Pattern-Matching Algorithms on Indeterminate Strings. In Daykin, J., Mohamed, M., Steinhoefel, K. (eds.): London Stringology Day + London Algorithmic Workshop 2006, King's College London Series Texts in Algorithmics, pp. 115-133, 2007.
Holub, J., Žďárek, J. (editors): Pre-proceedings of CIAA 2007. Czech Technical University in Prague, Prague, July 16-18, 2007, 284 pages, ISBN 978-80-01-03764-5, 2007.
Antoniou, P., Holub, J., Iliopoulos, C.S., Melichar, B., Peterlongo, P.: Finding Common Motifs with Gaps using Finite Automata. In O. H. Ibarra, Hsu-Chun Yen (eds.): Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA2006), National Taiwan University, Taipei, Taiwan, LNCS4094, Springer-Verlag, pp. 69-77, 2006.
Holub, J., Smyth, W. F., Wang, S.: Fast Pattern-Matching on Indeterminate Strings. In J. Ryan, P. Manyem, K. Sugeng, M. Miller (eds.): Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms AWOCA'05, University of Ballarat, Victoria, Australia, pp. 415-428, 2005.
Franěk, F., Holub, J., Rosa, A.: Two factorizations of small complete graphs II: The case of 13 vertices. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 51, 2004, pp. 89-94.
Holub, J., Špiller, P.: Practical Experiments with NFA Simulation. In L. Cleophas, B. W. Watson (eds): Proceedings of the Eindhoven FASTAR Days 2004, invited talk, Technical University of Eindhoven, 2004, pp. 73-95.
Holub, J., Smyth, W. F.: Algorithms on Indeterminate Strings. In Miller, M., Park, K. (eds.): Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms AWOCA'03, Seoul National University, Seoul, Korea, 2003, pp. 36-45.
2002
Holub, J.: Dynamic Programming - NFA Simulation. Proceedings of the 7th Conference on Implementation and Application of Automata, University of Tours, Tours, France, July 2002, LNCS2608, Springer-Verlag, pp. 295-300.
Holub, J.: Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching. Kybernetika, Vol. 38(1), 2002, pp. 81-90.
Holub, J., Crochemore, M.: On the Implementation of Compact DAWG's. Proceedings of the 7th Conference on Implementation and Application of Automata, University of Tours, Tours, France, July 2002, LNCS2608, Springer-Verlag, 2003, pp. 289-294.
2001
Holub, J.: Bit Parallelism - NFA Simulation. Proceedings of the 6th Conference on Implementation and Application of Automata, University of Pretoria, Pretoria, South Africa, July 2001, LNCS2494, Springer-Verlag, 2002, pp. 149-160.
Holub, J., Iliopoulos, C.S., Melichar, B., Mouchard, L.: Distributed String Matching using Finite Automata. In Raman, R., Simpson, J., (eds.) Proceedings of the Tenth Australasian Workshop on Combinatorial Algorithms AWOCA'99, Curtin University of Technology, Perth, Australia, 1999, pp. 114-128.
Melichar, B., Holub, J.: Algorithms for Pattern Matching. In Proceedings of Summer School of Information Systems and Their Applications 1999, Ruprechtov, Czech Republic, September 1999, pp. 69-78.
1998
Holub, J.: Simulation of Nondeterministic Finite Automata in Approximate String and Sequence Matching. Research Report DC-98-04, Czech Technical University in Prague, Prague, April 1998, 28 pages.
Holub, J.: Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching. Proceedings of the Prague Stringology Club Workshop '98, Czech Technical University in Prague, Prague, September 1998, pp. 73-82.
Holub, J., Melichar, B.: Approximate String Matching Using Factor Automata. In Costas S. Iliopoulos (ed.): Proceedings of Ninth Australasian Workshop on Combinatorial Algorithms AWOCA'98, Curtin University of Technology, Perth, West Australia, July 1998, pp. 28-39.
Holub, J., Melichar, B.: Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. In Proceedings of Third International Workshop on Implementing Automata WIA'98, University of Rouen, France, September 1998, LNCS1660, Springer-Verlag, Berlin, pp. 92-99.
Melichar, B., Holub, J.: Pattern Matching and Finite Automata. In Proceedings of Summer School of Information Systems and Their Applications 1998, Ruprechtov, Czech Republic, September 1998, pp. 154-183.
Department of Theoretical Computer Science