In the course we deal with selected methods and results of some
advanced topics in theoretical computer science,
e.g. in the area of approximation algorithms,
probabilistic algorithms, verification of concurrent systems.
Literature
P. Jančar: a working text for the course
Advised literature
Ausiello, Crescenzi, Gambosi, Kann, Marchetti-Spaccamela, Protasi: Complexity
and Approximation; Springer 1999
Clarke, Grumberg, Peled: Model Checking, MIT Press 1999
T. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms; The MIT Press,
1990
Gibbons, Rytter: Efficient parallel algorithms; 1988, Cambridge Univ.Press,
J.Gruska: Foundation of Computing. International Thomson Computer Press 1997.
Gruska, Jozef: Quantum Computing, Mc Graw Hill 1999
Hromkovič J.: Communication complexity and parallel computing; Springer 1997
Lynch N.A.: Distributed Algorithms; Morgan Kaufmann 1996
Reisig, Rosenberg (eds.): Lectures on Petri nets I, II, Springer 1998
M. Sipser: Introduction to the Theory of Computation; PWS 1997