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 S, Pietrzak KZ, Venturi D. Tamper proof circuits How to trade leakage for tamper resilience. In: Vol 6755. Springer; 2011:391-402. doi:10.1007/978-3-642-22006-7_33
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3236
Jain A, Pietrzak KZ. Parallel repetition for leakage resilience amplification revisited. In: Vol 6597. Springer; 2011:58-69. doi:10.1007/978-3-642-19571-6_5
View
| DOI
2011 |Published| Book Chapter | IST-REx-ID: 3271
Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. Topological Methods in Data Analysis and Visualization II. Springer; 2011:91-106. doi:10.1007/978-3-642-23175-9_7
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3326 | 
Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3324 |
Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi: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 U, Kupferman O. Co-Büching them all. In: Hofmann M, ed. Vol 6604. Springer; 2011:184-198. doi:10.1007/978-3-642-19805-2_13
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3342 |
Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi: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 K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3348 |
Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3344
Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3343 |
Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:10.1137/1.9781611973082.101
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
View
| DOI
2011 |Published| Journal Article | IST-REx-ID: 531 |
Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models. Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Technical Report | IST-REx-ID: 5379 |
Chatterjee K, Henzinger MH. 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| Technical Report | IST-REx-ID: 5381 |
Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007
[Published Version]
View
| Files available
| DOI
2011 |Published| Technical Report | IST-REx-ID: 5380 |
Chatterjee K. Bounded Rationality in Concurrent Parity Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0008
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3338 |
Chatterjee K. Bounded rationality in concurrent parity games. arXiv. 2011:1-51.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3323
Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3366 |
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. Quantitative synthesis for concurrent programs. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:243-259. doi:10.1007/978-3-642-22110-1_20
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3345 |
Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi:10.1007/978-3-642-22993-0_21
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv