ISTA Research Explorer

Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

Maximilian Weininger

Ali Asadi

Ehsan Kafshdar Goharshadi

Jakub Svoboda

Krishnendu Chatterjee

Valentin Hübner

Mehrdad Karrabi

Raimundo Saona Urmeneta

Ruichen Luo

Amir Goharshady

Hongfei Fu

Viktor Toman

Rasmus Ibsen-Jensen

Djordje Zikelic

Pepa Tkadlec

Mathieu Tracol

Martin Chmelik

Ventsislav Chonev

Florian Horn

Laura Schmid

Tadeas Priklopil

Petr Novotny

Jan Kretinsky

Joost Katoen

Sasha Rubin

Christian Hilbe

Andreas Pavlogiannis

Benjamin Aminof

Johannes Reiter

Maria Kleshnina

John Lazarsfeld

Ismael Jecker

Mingzhang Huang

Tobias Meggendorfer

454 Publications

Search / Filter

2011 | Published | Conference Paper | IST-REx-ID: 3343 |

K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.

[Submitted Version] View | DOI | Download Submitted Version (ext.)

2011 | Published | Conference Paper | IST-REx-ID: 3344

K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.

View | DOI

2011 | Published | Technical Report | IST-REx-ID: 5379 |

K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5380 |

K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5381 |

K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5382 |

K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5384 |

K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5385 |

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Technical Report | IST-REx-ID: 5387 |

K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.

[Published Version] View | Files available | DOI

2011 | Published | Conference Paper | IST-REx-ID: 3345 |

K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.

[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv

2011 | Published | Conference Paper | IST-REx-ID: 3346 |

T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.

[Submitted Version] View | DOI | Download Submitted Version (ext.)

2011 | Published | Conference Paper | IST-REx-ID: 3347 |

K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.

[Preprint] View | DOI | Download Preprint (ext.) | arXiv

2011 | Published | Conference Paper | IST-REx-ID: 3348 |

K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.

[Submitted Version] View | DOI | Download Submitted Version (ext.)

2011 | Published | Conference Paper | IST-REx-ID: 3349 |

K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.

[Submitted Version] View | DOI | Download Submitted Version (ext.)

2011 | Published | Conference Paper | IST-REx-ID: 3350

K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.

View | DOI

2011 | Published | Conference Paper | IST-REx-ID: 3351 |

K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.

[Submitted Version] View | DOI | Download Submitted Version (ext.)

2011 | Published | Journal Article | IST-REx-ID: 3354

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.

View | Files available | DOI

2011 | Published | Conference Paper | IST-REx-ID: 3356 |

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.

[Submitted Version] View | Files available | DOI

2011 | Published | Conference Paper | IST-REx-ID: 3357

K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.

View | DOI

2011 | Published | Conference Paper | IST-REx-ID: 3361 |

P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.

[Submitted Version] View | Files available | DOI