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: 3360 | 
Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3264
Gupta, A., Popeea, C., & Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. https://doi.org/10.1007/978-3-642-25318-8_16
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3316 |
Bloem, Roderick, Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. 2011
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3366 |
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3361 |
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3356 |
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5385 |
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3347 |
Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3345 |
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/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, K., & Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11
View
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5387 |
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
[Published Version]
View
| Files available
| DOI
2011 | Published | Technical Report | IST-REx-ID: 5382 |
Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3342 |
Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3238
Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., & Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. https://doi.org/10.1007/978-3-642-20465-4_3
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In 5th International Workshop on Reachability Problems (Vol. 6945, pp. 1–1). Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3334
Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3163
Lampert, C. (2011). Maximum margin multi-label structured prediction. Presented at the NIPS: Neural Information Processing Systems, Granada, Spain: Neural Information Processing Systems Foundation.
View
| Files available
2011 | Published | Conference Poster | IST-REx-ID: 3322
Lampert, C. (2011). Maximum margin multi label structured prediction. NIPS: Neural Information Processing Systems. Neural Information Processing Systems Foundation.
View
| Files available
2011 | Published | Conference Paper | IST-REx-ID: 3329 |
Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3346 |
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv