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.

498 Publications


2018 | Published | Conference Paper | IST-REx-ID: 35 | OA
Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling . AAAI Press; 2018.
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 2 | OA
Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with private, noisy, and incomplete information. PNAS. 2018;115(48):12241-12246. doi:10.1073/pnas.1810565115
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 311 | OA
Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26
[Published Version] View | Files available | DOI
 

2018 | Published | Conference Paper | IST-REx-ID: 6340 | OA
Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348. doi:10.1109/Cybermatics_2018.2018.00231
[Submitted Version] View | Files available | DOI | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
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.) | arXiv
 

2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158121
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 1009 | OA
Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence. Vol 5. AAAI Press; 2017:3725-3732.
[Submitted Version] View | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1294 | OA
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 | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18
[Submitted Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 10416 | OA
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118
[Published Version] View | Files available | DOI | arXiv
 

2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1
[Published Version] View | Files available | DOI
 

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 | Published | Journal Article | IST-REx-ID: 464 | OA
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 | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18
[Published Version] View | Files available | DOI
 

2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 1011 | OA
Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:10.1007/978-3-662-54434-1_11
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed