Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




4983 Publications

2012 | Journal Article | IST-REx-ID: 3310 | OA
Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.
[Submitted Version] View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3836
Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 2972 | OA
Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
[Published Version] View | Files available | DOI | arXiv
 
2012 | Journal Article | IST-REx-ID: 2967
Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 493 | OA
Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.
[Published Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 495 | OA
Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.
[Published Version] View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 498 | OA
Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.
[Published Version] View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 496 | OA
Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.
[Preprint] View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 494
Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 506 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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 | OA
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
 
2012 | Journal Article | IST-REx-ID: 3249
Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3124 | OA
Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, .
[Submitted Version] View | Files available
 

Search

Filter Publications