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.

459 Publications


2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | DOI
 

2011 | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
[Published Version] View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5381 | OA
Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
[Published Version] View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
[Published Version] View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5382 | OA
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
[Published Version] View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI
 

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

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

Filters and Search Terms

department=KrCh

Search

Filter Publications