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.
1624 Publications
2011 |Published| Journal Article | IST-REx-ID: 3101 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Zwiewka et al., “The AP 3 adaptor complex is required for vacuolar function in Arabidopsis,” Cell Research, vol. 21, no. 12. Nature Publishing Group, pp. 1711–1722, 2011.
View
| DOI
| Download (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3138
D. Sullivan, J. L. Csicsvari, K. Mizuseki, S. Montgomery, K. Diba, and G. Buzsáki, “Relationships between hippocampal sharp waves ripples and fast gamma oscillation Influence of dentate and entorhinal cortical activity,” Journal of Neuroscience, vol. 31, no. 23. Society for Neuroscience, pp. 8605–8616, 2011.
View
| DOI
2011 |Published| Book Chapter | IST-REx-ID: 3271
H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3326 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3324 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3342 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3347 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3348 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3343 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 531 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Technical Report | IST-REx-ID: 5379 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Technical Report | IST-REx-ID: 5381 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Technical Report | IST-REx-ID: 5380 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3338 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv