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

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

499 Publications


2012 | Published | Conference Paper | IST-REx-ID: 3135 | OA
Efficient controller synthesis for consumption games with multiple resource types
B. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, in:, Springer, 2012, pp. 23–38.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 2916 | OA
Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 3252 | OA
Synthesizing protocols for digital contract signing
K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 2956 | OA
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Technical Report | IST-REx-ID: 5377 | OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 | Published | Conference Paper | IST-REx-ID: 10904 | OA
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J.-F. Raskin, in:, M. Koutny, I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory, Springer, Berlin, Heidelberg, 2012, pp. 115–131.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 2947 | OA
Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 3165 | OA
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Journal Article | IST-REx-ID: 2972 | OA
Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
[Published Version] View | Files available | DOI | arXiv
 

2012 | Published | Conference Paper | IST-REx-ID: 496 | OA
Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
[Preprint] View | DOI | Download Preprint (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3343 | OA [Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3365 | OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3315 | OA
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
[Published Version] View | Files available | DOI
 

2011 | Published | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.
[Published Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed