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: 239
2011
-
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Proceedings 26th Annual IEEE Symposium on Logic in Computer Science, year: 2011
-
Using Neighborhood Diversity to Solve Hard Problems
Year: 2011, type: Appeared in Conference without Proceedings
-
What Determines Difficulty of Transport Puzzles?
Twenty-Fourth International Florida Artificial Intelligence Research Society Conference, year: 2011
2010
-
35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010)
Year: 2010, type: Conference
-
4th International Workshop on Reachability Problems
Year: 2010, type: Workshop
-
A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL
Proceedings of the 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISOLA'10), year: 2010
-
A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking
Proceedings of the 7th European Performance Engineering Workshop (EPEW'10), year: 2010
-
Algebraic theories
Year: 2010, number of pages: 249 s.
-
Analýza obtížnosti logických úloh na základě modelů lidského chování
Kognice a umělý život X, year: 2010
-
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), year: 2010