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
2010
-
Space-efficient scheduling of stochastically generated tasks
Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), year: 2010
-
Stochastic Real-Time Games with Qualitative Timed Automata Objectives
CONCUR 2010 - Concurrency Theory, year: 2010
-
What are sifted colimits?
Theory and Applications of categories, year: 2010, volume: 23, edition: 1
2009
-
A counterexample to a conjecture concerning concatenation hierarchies
Information Processing Letters, year: 2009, volume: 110, edition: 1
-
Addendum to Matroid Tree-Width
European Journal of Combinatorics, year: 2009, volume: 30, edition: 4
-
Almost Linear Büchi Automata
Proceedings 16th International Workshop on Expressiveness in Concurrency 2009 (EXPRESS'09), year: 2009
-
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Proceedings of 11th International Conference on Formal Engineering Methods (ICFEM'09), pages 698-716 , volume 5885 of LNCS, Springer-Verlag, 2009., year: 2009
-
Approximating the Crossing Number of Apex Graphs
Symposium Graph Drawing 2008, Lecture Notes in Computer Science, year: 2009
-
Better Polynomial Algorithms on Graphs of Bounded Rank-width.
IWOCA 2009: International Workshop On Combinatorial Algorithms, Lecture Notes in Computer Science 5874, year: 2009
-
Beyond Language Equivalence on Visibly Pushdown Automata
Logical Methods in Computer Science, year: 2009, volume: 5/200, edition: 1:2