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.
485 Publications
2018 | Published | Conference Paper | IST-REx-ID: 143 |

Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 24 |

Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 25 |

Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2018 | Published | Journal Article | IST-REx-ID: 293 |

Hoffman M, Hilbe C, Nowak M. 2018. The signal-burying game can explain why we obscure positive traits and good deeds. Nature Human Behaviour. 2, 397–404.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 310 |

Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 454 |

Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 5679 |

Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 157 |

Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Journal Article | IST-REx-ID: 738 |

Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 79 |

Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 198 |

Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2018 | Published | Conference Paper | IST-REx-ID: 141 |

Chatterjee K, Henzinger M, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 297 |

Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.
[Published Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 5967 |

Hansen, Kristoffer Arnsfelt, The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18. 2018
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 | Published | Conference Paper | IST-REx-ID: 35 |

Chatterjee, Krishnendu, Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling . 2018
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 10883 |

Chatterjee, Krishnendu, Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning 57. 2018
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 2 |

Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private, noisy, and incomplete information. PNAS. 115(48), 12241–12246.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| PubMed | Europe PMC
2018 | Published | Conference Paper | IST-REx-ID: 66 |

Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 311 |

Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.
[Published Version]
View
| Files available
| DOI