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: 238
2005
-
A Parametrized Algorithm for Matroid Branch-Width
SIAM Journal on Computing, year: 2005, volume: 35, edition: 2
-
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), year: 2005
-
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
25th International Conference on Foundations of Software Technology and Theoretical Computer Science, year: 2005
-
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width (extended abstract)
WG 2005, year: 2005
-
Concrete Search with Abstract Matching and Refinement
Computer Aided Verification, year: 2005
-
Decidability Issues for Extended Ping-Pong Protocol
Journal of Automated Reasoning, year: 2005, volume: ?, edition: ?
-
Deeper Connections between LTL and Alternating Automata
Implementation and Application of Automata, year: 2005
-
From Distributed Memory Cycle Detection to Parallel LTL Model Checking
Electronical Notes in Theoretical Computer Science, year: 2005, volume: 2005, edition: 133
-
How to Cope with Higher Dependency in Partial Order Reduction for LTL Model Checking
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005), year: 2005
-
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005), year: 2005