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.
513 Publications
2017 | Published | Conference Paper | IST-REx-ID: 628 | 
Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 512 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 13160 |
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. Index appearance record for transforming Rabin automata into parity automata. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 10205. Springer; 2017:443-460. doi:10.1007/978-3-662-54577-5_26
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 465 |
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Journal Article | IST-REx-ID: 464 |
Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 467 |
Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Published | Journal Article | IST-REx-ID: 466 |
Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Thesis | IST-REx-ID: 821 |
Pavlogiannis A. Algorithmic advances in program analysis and their applications. 2017. doi:10.15479/AT:ISTA:th_854
[Published Version]
View
| Files available
| DOI
2017 | Published | Journal Article | IST-REx-ID: 1294 |
Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences. 2017;84:144-170. doi:10.1016/j.jcss.2016.09.009
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 949 |
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
2017 | Published | Conference Paper | IST-REx-ID: 639 |
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.)
| WoS
| arXiv
2016 | Published | Technical Report | IST-REx-ID: 5451 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Thesis | IST-REx-ID: 1397
Chmelik M. Algorithms for partially observable markov decision processes. 2016.
View
2016 | Published | Conference Paper | IST-REx-ID: 1325 |
Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.10
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5453 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5452 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Technical Report | IST-REx-ID: 5445 |
Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis. IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1093 |
Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.20
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1438 |
Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:10.1145/2837614.2837639
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Published | Conference Paper | IST-REx-ID: 1182 |
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.)
| arXiv