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.
454 Publications
2015 |
Published |
Technical Report |
IST-REx-ID: 5437 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5438 |
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5440 |
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5441 |
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5443 |
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Technical Report |
IST-REx-ID: 5444 |
J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Research Data |
IST-REx-ID: 5549 |
A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.
[Published Version]
View
| Files available
| DOI
2015 |
Published |
Conference Paper |
IST-REx-ID: 10796
K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.
[Preprint]
View
| DOI
| arXiv
2015 |
Published |
Journal Article |
IST-REx-ID: 523 |
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 25–52, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 |
Published |
Journal Article |
IST-REx-ID: 524 |
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 1733 |
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 1884
D. Landau et al., “Novel putative driver gene mutations in chronic lymphocytic leukemia (CLL): results from a combined analysis of whole exome sequencing of 262 primary CLL aamples,” Blood, vol. 124, no. 21. American Society of Hematology, pp. 1952–1952, 2014.
View
| Download None (ext.)
2014 |
Published |
Conference Paper |
IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2027 |
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2038 |
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
[Submitted Version]
View
| Files available
| DOI
2014 |
Published |
Journal Article |
IST-REx-ID: 2039 |
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
[Published Version]
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2052
B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.
View
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2053 |
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Conference Paper |
IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View
| Files available
| DOI