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.
332 Publications
2012 | Journal Article | IST-REx-ID: 506 | 
Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 497 |
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 | Conference Paper | IST-REx-ID: 3165 |
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 | 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 | Technical Report | IST-REx-ID: 5377 |
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2955 |
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 | Conference Paper | IST-REx-ID: 3341 |
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 | Conference Paper | IST-REx-ID: 2957 |
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv