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.

457 Publications


2017 | Journal Article | IST-REx-ID: 512 | OA
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
 

2017 | 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 | 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 | Journal Article | IST-REx-ID: 10417 | OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2017 | 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 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61
[Published Version] View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39
[Published Version] View | Files available | DOI
 

2017 | 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.)
 

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

Filters and Search Terms

department=KrCh

Search

Filter Publications