Project information
Institute for Theoretical Computer Science
- Project Identification
- 1M0545
- Project Period
- 1/2005 - 12/2011
- Investor / Pogramme / Project type
-
Ministry of Education, Youth and Sports of the CR
- Research Centres (National Research Programme)
- MU Faculty or unit
- Faculty of Informatics
- Project Website
- http://www.fi.muni.cz/iti/
- Cooperating Organization
-
Institute of Mathematics of the ASCR, v. v. i.
- Responsible person prof. RNDr. Pavel Pudlák, DrSc.
- Responsible person doc. RNDr. Jiří Šíma, DrSc.
- Responsible person prof. RNDr. Jaroslav Nešetřil, DrSc.
- Responsible person prof. RNDr. Zdeněk Ryjáček, DrSc.
The subject of the research activities of the institute are methods, algorithms, and structures of theoretical computer science, and their applications in information technologies.
Publications
Total number of publications: 240
2011
-
Efficient Analysis of Probabilistic Programs with an Unbounded Counter
Computer Aided Verification, 23rd International Conference, CAV 2011, year: 2011
-
Efficient Loop Navigation for Symbolic Execution
Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, year: 2011
-
Fixed-delay Events in Generalized Semi-Markov Processes Revisited
CONCUR 2011 - Concurrency Theory: 22nd International Conference, year: 2011
-
How Not to Characterize Planar-emulable Graphs
COMBINATORIAL ALGORITHMS, Lecture Notes in Computer Science 7056, year: 2011
-
Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups
Algebraic Foundations in Computer Science, year: 2011
-
Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata
HSCC 11: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control, year: 2011
-
Modelování a simulace komplexních systémů. Jak lépe porozumět světu
Year: 2011, edition: Vyd. 1., number of pages: 236 s.
-
On Biautomata
Non-Classical Models for Automata and Applications, year: 2011
-
Parameterized Problems Related to Seidel's Switching
Discrete Mathematics & Theoretical Computer Science, year: 2011, volume: 13, edition: 2
-
Piecewise Testable Languages via Combinatorics on Words
Discrete Mathematics, year: 2011, volume: 311, edition: 20, DOI