Please note that IST 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.

3017 Publications


2012 | Journal Article | IST-REx-ID: 3836
Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code
A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.
View | DOI
 

2012 | Journal Article | IST-REx-ID: 3168
Lumpability abstractions of rule based systems
J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3846 | OA
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 2972 | OA
Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
View | Files available | DOI | arXiv
 

2012 | Journal Article | IST-REx-ID: 2967
Algorithmic analysis of array-accessing programs
R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012).
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 492 | OA
GiA Roots: Software for the high throughput analysis of plant root system architecture
T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 493 | OA
Review of the BCI competition IV
M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 494
Translating to Co-Büchi made tight, unified, and useful
U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 495 | OA
A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 496 | OA
Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
View | DOI | Download Preprint (ext.)
 

2012 | Journal Article | IST-REx-ID: 506 | OA
Cell migration: Fibroblasts find a new way to get ahead
M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 498 | OA
Predicting local adaptation in fragmented plant populations: Implications for restoration genetics
M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 497 | OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 2956
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3165
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5377 | OA
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5378 | OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 2955 | OA
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3341 | OA
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 2957 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

extern<>1

Search

Filter Publications