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
2006
-
Refining Undecidability Border of Weak Bisimilarity.
Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05), year: 2006
-
Routing and Level 2 Addressing in a Hardware Accelerator for Network Applications
ICT 2006, 13th International Conference on Telecommunications, year: 2006
-
Routing, L2 Addressing, and Packet Filtering in a Hardware Engine
Proceedings of MEMICS 2006, year: 2006
-
Special Issue on Parallel and Distributed Verification - Foreword
Formal Methods in System Design, year: 2006, volume: 29, edition: 2
-
Stochastic Games with Branching-Time Winning Objectives
21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, Washington, USA, Proceedings, year: 2006
-
Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
Mathematical Foundations of Computer Science, year: 2006
-
Test Input Generation for Java Containers using State Matching
International Symposium on International Symposium on Software Testing and Analysis, year: 2006
-
The Tutte Polynomial for Matroids of Bounded Branch-Width
Combin. Prob. Computing, year: 2006, volume: 15, edition: 3
-
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06), year: 2006, volume: 2006, edition: 3921
-
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
LNCS, Annual Conference on Computer Science Logic (CSL'06), year: 2006, volume: 2006, edition: 4207