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

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




6092 Publications

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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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: 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 | OA
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 | OA
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 | OA
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
 
2011 | Submitted | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, 1107.2132, doi:10.48550/arXiv.1107.2132.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. 1104.0127, ArXiv, doi:10.48550/arXiv.1104.0127.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0008.
[Published Version] View | Files available | DOI
 
2011 | Submitted | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv, 1107.2146, pp. 1–51, doi:10.48550/arXiv.1107.2146.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | 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, doi:10.15479/AT:IST-2011-0009.
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
[Published Version] View | DOI | Download Published Version (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed