Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
454 Publications
2017 |
Published |
Journal Article |
IST-REx-ID: 716 |
Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 717 |
Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |
Published |
Journal Article |
IST-REx-ID: 744 |
Priklopil T, Chatterjee K, Nowak M. 2017. Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma. Journal of Theoretical Biology. 433, 64–72.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2017 |
Published |
Journal Article |
IST-REx-ID: 464 |
Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
[Published Version]
View
| Files available
| DOI
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 465 |
Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Journal Article |
IST-REx-ID: 466 |
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.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Journal Article |
IST-REx-ID: 467 |
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 512 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Technical Report |
IST-REx-ID: 5455 |
Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Technical Report |
IST-REx-ID: 5456 |
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 551 |
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.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 552 |
Chatterjee K, Henzinger MH, 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.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 553 |
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.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 |
Research Data |
IST-REx-ID: 5559 |
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers of natural selection, Institute of Science and Technology Austria, 10.15479/AT:ISTA:51.
[Published Version]
View
| Files available
| DOI
2017 |
Published |
Book Chapter |
IST-REx-ID: 625 |
Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.
[Submitted Version]
View
| Files available
| DOI
2017 |
Published |
Conference Paper |
IST-REx-ID: 628 |
Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |
Published |
Conference Paper |
IST-REx-ID: 639 |
Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 |
Published |
Conference Paper |
IST-REx-ID: 645 |
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |
Published |
Conference Paper |
IST-REx-ID: 6519 |
Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.
[Published Version]
View
| Files available
| DOI