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.
10763 Publications
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
2011 | Published | Conference Paper | IST-REx-ID: 3351 |
Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer. https://doi.org/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, K., & Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3349 |
Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3374 |
Tkačik, G., & Walczak, A. (2011). Information transmission in genetic regulatory networks a review. Journal of Physics: Condensed Matter. IOP Publishing. https://doi.org/10.1088/0953-8984/23/15/153102
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3391 |
de Vladar, H., & Barton, N. H. (2011). The contribution of statistical physics to evolutionary biology. Trends in Ecology and Evolution. Cell Press. https://doi.org/10.1016/j.tree.2011.04.002
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3377 |
Edelsbrunner, H., Morozov, D., & Patel, A. (2011). Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-011-9090-8
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2011 | Published | Technical Report | IST-REx-ID: 5381 |
Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007
[Published Version]
View
| Files available
| DOI
2011 | Submitted | Preprint | IST-REx-ID: 3339 |
Chatterjee, K., De Alfaro, L., & Pritam, R. (n.d.). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. https://doi.org/10.48550/arXiv.1107.2132
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv