Please note that IST 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.

363 Publications


2017 | Journal Article | IST-REx-ID: 464 | OA
Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 466 | OA
Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 467 | OA
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2017 | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.
View | Files available | DOI
 

2017 | Technical Report | IST-REx-ID: 5456 | OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee K, Henzinger M, Svozil A. 2017. Faster algorithms for mean payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.
View | Files available | DOI | Download Published Version (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications