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.

454 Publications


2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2016 | Published | 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
 

2016 | Published | 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 | Published | 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 | Published | 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 | 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 | 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 | Published | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.
[Published Version] View | Files available | DOI
 

2016 | Published | Conference Paper | IST-REx-ID: 1069 | OA
Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.
[Published Version] View | Files available | DOI
 

2016 | Published | Conference Paper | IST-REx-ID: 1070 | OA
Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.
[Published Version] View | Files available | DOI
 

2016 | Published | 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 | Published | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.
[Published Version] View | Files available | DOI
 

2016 | Published | 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
 

2015 | Published | Journal Article | IST-REx-ID: 523 | OA
Chatterjee K, Doyen L, Randour M, Raskin J. 2015. Looking at mean-payoff and total-payoff through windows. Information and Computation. 242(6), 25–52.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2015 | Published | Journal Article | IST-REx-ID: 524 | OA
Chatterjee K, Ibsen-Jensen R. 2015. Qualitative analysis of concurrent mean payoff games. Information and Computation. 242(6), 2–24.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Technical Report | IST-REx-ID: 5429 | OA
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs, IST Austria, 31p.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee K, Ibsen-Jensen R, Hansen K. 2015. The patience of concurrent stochastic games with safety and reachability objectives, IST Austria, 25p.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary games on graphs, IST Austria, 29p.
[Published Version] View | Files available | DOI
 

2015 | Published | Technical Report | IST-REx-ID: 5435 | OA
Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed