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
2012 |Published| Conference Paper | IST-REx-ID: 497 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3165 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5378 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2955 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 3341 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Journal Article | IST-REx-ID: 808 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Vinzenz M, Nemethova M, Schur FK, Mueller J, Narita A, Urban E, Winkler C, Schmeiser C, Koestler S, Rottner K, Resch G, Maéda Y, Small J. 2012. Actin branching in the initiation and maintenance of lamellipodia. Journal of Cell Science. 125(11), 2775–2785.
View
| Files available
| DOI
2012 | Research Data Reference | IST-REx-ID: 9757 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2012. Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison, Dryad, 10.5061/dryad.61649.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2012 |Published| Journal Article | IST-REx-ID: 966 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bieri S, Serbyn M, Senthil T, Lee P. 2012. Paired chiral spin liquid with a Fermi surface in S=1 model on the triangular lattice. Physical Review B - Condensed Matter and Materials Physics. 86(22).
View
| DOI
| Download (ext.)
2012 |Published| Conference Paper | IST-REx-ID: 10903
Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.
View
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 10905 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 10906 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 |Published| Book Chapter | IST-REx-ID: 5745 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3251 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.
[Submitted Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3127 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Quadrianto N, Lampert C, Chen C. 2012. The most persistent soft-clique in a set of sampled graphs. Proceedings of the 29th International Conference on Machine Learning. ICML: International Conference on Machine Learning, 211–218.
[Preprint]
View
| Download Preprint (ext.)