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


2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong amplifiers of natural selection. 2017. doi:10.15479/AT:ISTA:51
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:10.1007/978-3-319-63390-9_3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee K, Goharshady AK, Pavlogiannis A. JTDec: A tool for tree decompositions in soot. In: D’Souza D, ed. Vol 10482. Springer; 2017:59-66. doi:10.1007/978-3-319-68167-2_4
[Submitted Version] View | Files available | DOI | WoS
 

2016 | Conference Paper | IST-REx-ID: 1068 | OA
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.25
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1069 | OA
Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.100
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1070 | OA
Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:10.4230/LIPIcs.ICALP.2016.98
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1090 | OA
Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.MFCS.2016.24
[Published Version] View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1138 | OA
Chatterjee K, Henzinger TA, Otop J. Quantitative automata under probabilistic semantics. In: Proceedings of the 31st Annual ACM/IEEE Symposium. IEEE; 2016:76-85. doi:10.1145/2933575.2933588
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1140 | OA
Chatterjee K, Dvoák W, Henzinger MH, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2016:197-206. doi:10.1145/2933575.2935304
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179.
[Preprint] View | Files available | Download Preprint (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications