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.

459 Publications


2016 | Conference Paper | IST-REx-ID: 1389 | OA
Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Journal Article | IST-REx-ID: 1426 | OA
Chakra M, Hilbe C, Traulsen A. 2016. Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. 3(5), 160036.
[Published Version] View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1423 | OA
Baek S, Jeong H, Hilbe C, Nowak M. 2016. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 6, 25676.
[Published Version] View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.
[Preprint] View | Files available | DOI | PubMed | Europe PMC
 

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: 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 | 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
 

2016 | Technical Report | IST-REx-ID: 5453 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong amplifiers of natural selection, IST Austria, 34p.
[Published Version] View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5451 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.
[Published Version] View | Files available | DOI
 

2016 | Research Data Reference | IST-REx-ID: 9867
Hilbe C, Hagel K, Milinski M. 2016. Experimental game instructions, Public Library of Science, 10.1371/journal.pone.0163867.s008.
[Published Version] View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1322 | OA
Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.
[Published Version] View | Files available | DOI
 

2016 | Research Data Reference | IST-REx-ID: 9868
Hilbe C, Hagel K, Milinski M. 2016. Experimental data, Public Library of Science, 10.1371/journal.pone.0163867.s009.
[Published Version] View | Files available | DOI
 

2016 | Thesis | IST-REx-ID: 1397
Chmelik M. 2016. Algorithms for partially observable markov decision processes. Institute of Science and Technology Austria.
View
 

2016 | Conference Paper | IST-REx-ID: 1093 | OA
Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1438 | OA
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications