Michal Voráček, Algorithms on Generalized Strings (graduated in March 2011)
MSc. students
Jiří Krotil, PPM Data Compresssion Methods (graduated in June 2012, Dean's Prize for Excellent Diploma Thesis awarded)
Jan Baier, Music Sheet Compression (graduated in February 2012)
Michal Valach, Effient Implementation of ACB Compression Algorithm for ExCom Library (graduated in June 2011)
Martin Kopta, Efficient DNA Indexing (graduated in June 2011)
Jan Skalický, On Applications of DCA (graduated in June 2010)
Jakub Řezníček, Corpus for Comparing Compression Methods and an Extension of ExCom Library (graduated in June 2010, Dean's Prize for Excellent Diploma Thesis awarded)
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)
Procházka, P., Holub, J.: Natural Language Compression Optimized for Large Set of Files. In A. Bilgin, M. W. Marcellin, J. Serra-Sagrista, J. A. Storer (eds.): Proceedings of Data Compression Conference 2013, IEEE Computer Society Press, p. 514, 2013.
Procházka, P., Holub, J.: Block-oriented Dense Compressor. In J. A. Storer, M. W. Marcellin (eds.): Proceedings of Data Compression Conference 2011, IEEE Computer Society Press, p. 472, 2011.
Procházka, P., Holub, J.: Natural Language Compression per Blocks.The First International Conference on Data Compression, Communications and Processing, CCP 2011, Palinuro, Italy, IEEE 2011, ISBN 978-1-4577-1458-0, pp. 67-75, 2011.
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, pp. 89-94, 2004.
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, pp. 36-45, 2003.
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, 2002.
Holub, J.: Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching. Kybernetika, Vol. 38 (1), pp. 81-90, 2002.
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, pp. 289-294, 2003.
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, pp. 149-160, 2002.
Melichar, B., Holub, J.: Algorithms for Pattern Matching. In Proceedings of Summer School of Information Systems and Their Applications 1999, Ruprechtov, Czech Republic, pp. 69-78, September 1999.
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, 28 pages, April 1998.
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, pp. 73-82, September 1998.
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, Perth, West Australia, pp. 28-39, July 1998.
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, LNCS1660, Springer-Verlag, Berlin, pp. 92-99, September 1998.
Melichar, B., Holub, J.: Pattern Matching and Finite Automata. In Proceedings of Summer School of Information Systems and Their Applications 1998, Ruprechtov, Czech Republic, pp. 154-183, September 1998.
Department of Theoretical Computer Science