Arbology at FIT

Lecture:   Arbology at FIT
Lecturer:     Doc. Ing. Jan Janoušek
Date and time: 18th March 2013, 6–7:30 p.m.
Place:       FIT CTU in Prague, 9 Thákurova Street, New Building CTU, lecture room T9:107


Theoretical computer science has got over 80 years of exciting history and along its development path there are many trees bearing the fruits of human genius = principles on which modern complex ICT technologies are based. The technologies change, the principles remain. These principles allow, among others, to understand various effective solutions of algorithmic problems and their time and memory complexities. Due to its long history, one might think that no new principles can be discovered in the theoretical computer science. Several years ago, a research group led by prof. Melichar started to work on principles that allowed to unify the worlds of algorithms for processing string and tree data structures and to describe these principles by formalisms from the theory of formal languages and automata. One of the main results is a new algorithmic discipline called Arbology.  Let us invite you to this world of linked concepts, abstractions and effective solutions of algorithmic problems of tree data structures processing.


Short CV:

Doc. Ing. Jan Janoušek, PhD, graduated at the Department of Computer Science FEE CTU Prague in 1994, where he also received his PhD in Computer Science under supervision of prof. Melichar in 2001. He is a founder member of FIT, where he was a chairman of the academic senate, among others. Since June 2012, he has been the head of the Department of Theoretical Computer Science. In 2010 he habilitated in Information Technology at FIT TU Brno. Currently, he is also a member of academic senate of the Czech Technical University in Prague. His professional interests include theory of parsing and semantic analysis, compiler construction, and recently, he works on the arbology.


Free entrance.



Last modified: 8.4.2013, 11:18