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.
1621 Publications
2011 |Published| Conference Paper | IST-REx-ID: 3239
Faust, Sebastian, Krzysztof Z Pietrzak, and Daniele Venturi. “Tamper Proof Circuits How to Trade Leakage for Tamper Resilience,” 6755:391–402. Springer, 2011. https://doi.org/10.1007/978-3-642-22006-7_33.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3236
Jain, Abhishek, and Krzysztof Z Pietrzak. “Parallel Repetition for Leakage Resilience Amplification Revisited,” 6597:58–69. Springer, 2011. https://doi.org/10.1007/978-3-642-19571-6_5.
View
| DOI
2011 |Published| Book Chapter | IST-REx-ID: 3271
Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of Persistent Homology for Cubical Data.” In Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert, Helwig Hauser, Hamish Carr, and Raphael Fuchs, 91–106. Springer, 2011. https://doi.org/10.1007/978-3-642-23175-9_7.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3326 | 
Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3324 |
Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3327
Boker, Udi, and Orna Kupferman. “Co-Büching Them All.” edited by Martin Hofmann, 6604:184–98. Springer, 2011. https://doi.org/10.1007/978-3-642-19805-2_13.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3342 |
Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. 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: 3347 |
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. 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: 3348 |
Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011. https://doi.org/10.1007/978-3-642-24288-5_1.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3343 |
Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View
| DOI
2011 |Published| Journal Article | IST-REx-ID: 531 |
Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design. Springer, 2011. https://doi.org/10.1007/s10703-011-0131-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Technical Report | IST-REx-ID: 5379 |
Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
[Published Version]
View
| Files available
| DOI
2011 |Published| Technical Report | IST-REx-ID: 5381 |
Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.
[Published Version]
View
| Files available
| DOI
2011 |Published| Technical Report | IST-REx-ID: 5380 |
Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3338 |
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3323
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3366 |
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3345 |
Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv