Please note that IST 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.

331 Publications


2011 | Technical Report | IST-REx-ID: 5380
Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3339   OA
Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.
View | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee, Krishnendu, Monika Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_21.
View | DOI | Download (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL) 12, no. 4 (2011). https://doi.org/10.1145/1970398.1970404.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee, Krishnendu, and Monika Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20 .
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
View | DOI | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3316
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
View | DOI
 

2011 | Technical Report | IST-REx-ID: 5381
Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee, Krishnendu, and Monika Henzinger. “Faster and Dynamic Algorithms for Maximal End Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101.
View | DOI | Download (ext.)
 

2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0001.
View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
View | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3356
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed