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.
5794 Publications
2013 | Published | Journal Article | IST-REx-ID: 2814 | 
Chatterjee, Krishnendu, et al. “The Complexity of Coverage.” International Journal of Foundations of Computer Science, vol. 24, no. 2, World Scientific Publishing, 2013, pp. 165–85, doi:10.1142/S0129054113400066.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 1374 |
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” 22nd EACSL Annual Conference on Computer Science Logic, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:10.4230/LIPIcs.CSL.2013.181.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2446 |
Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2444 |
Chatterjee, Krishnendu, and Jakub Ła̧Cki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2836 |
Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.” Formal Aspects of Computing, vol. 26, no. 4, Springer, 2013, pp. 825–59, doi:10.1007/s00165-013-0283-6.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2824
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.” Information and Computation, vol. 228–229, Elsevier, 2013, pp. 83–119, doi:10.1016/j.ic.2013.04.003.
View
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2305 |
Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–40, doi:10.1109/LICS.2013.39.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2295 |
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5400 |
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013, doi:10.15479/AT:IST-2013-109-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5404 |
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-127-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5405 |
Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5408 |
Chatterjee, Krishnendu, et al. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013, doi:10.15479/AT:IST-2013-141-v1-1.
[Published Version]
View
| Files available
| DOI
2013 | Published | Journal Article | IST-REx-ID: 2817 |
Novak, Sebastian, et al. “Density Games.” Journal of Theoretical Biology, vol. 334, Elsevier, 2013, pp. 26–34, doi:10.1016/j.jtbi.2013.05.029.
[Published Version]
View
| Files available
| DOI
2013 | Published | Journal Article | IST-REx-ID: 2289 |
Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2182
Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.
View
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 1387 |
Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2301
Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.
View
| DOI
| Download None (ext.)
2013 | Published | Conference Paper | IST-REx-ID: 2243 |
Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2298 |
Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.
[Submitted Version]
View
| Files available
| DOI