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.
331 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3326 | 
Almagor, Shaull, et al. What’s Decidable about Weighted Automata. Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3315 |
Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3362 |
Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3359
Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3360 |
Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3264
Gupta, Ashutosh, et al. Solving Recursion-Free Horn Clauses over LI+UIF. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:10.1007/978-3-642-25318-8_16.
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3366 |
Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3347 |
Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3345 |
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | 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, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11.
View
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5387 |
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011, doi:10.15479/AT:IST-2011-0001.
[Published Version]
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5382 |
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3238
Kiltz, Eike, et al. Efficient Authentication from Hard Learning Problems. Vol. 6632, Springer, 2011, pp. 7–26, doi:10.1007/978-3-642-20465-4_3.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” 5th International Workshop on Reachability Problems, vol. 6945, Springer, 2011, pp. 1–1, doi:10.1007/978-3-642-24288-5_1.
View
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3163
Lampert, Christoph. Maximum Margin Multi-Label Structured Prediction. Neural Information Processing Systems Foundation, 2011.
View
| Files available
2011 | Published | Conference Poster | IST-REx-ID: 3322
Lampert, Christoph. “Maximum Margin Multi Label Structured Prediction.” NIPS: Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2011.
View
| Files available
2011 | Published | Conference Paper | IST-REx-ID: 3351 |
Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives. Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3348 |
Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3349 |
Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv