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.

4959 Publications


2016 | Journal Article | IST-REx-ID: 1479 | OA
Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
[Submitted Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 479
Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime verification to improve the quality of medical care practice. Proceedings of the 38th International Conference on Software Engineering Companion . ICSE: International Conference on Software Engineering, Proceedings International Conference on Software Engineering, , 112–121.
View | DOI
 

2016 | Conference Paper | IST-REx-ID: 480 | OA
Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1379 | OA
Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15.
[Published Version] View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Technical Report | IST-REx-ID: 5445 | OA
Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.
View | Files available
 

2016 | Technical Report | IST-REx-ID: 5449 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.
[Updated Version] View | Files available | DOI
 

Filters and Search Terms

extern<>1

Search

Filter Publications