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.
520 Publications
2019 |
Published |
Conference Paper |
IST-REx-ID: 6780 |
Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6490 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, 2019. https://doi.org/10.1145/3297280.3297322.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Conference Paper |
IST-REx-ID: 6378 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Conference Paper |
IST-REx-ID: 6175 |
Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 7158 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Journal Article |
IST-REx-ID: 7014 |
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 6380 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366.
[Published Version]
View
| Files available
| DOI
2019 |
Published |
Conference Paper |
IST-REx-ID: 6056 |
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 293 |
Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0354-z.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 297 |
Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 310 |
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 325 |
Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 34 |
Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives.” In 28th International Conference on Automated Planning and Scheduling, 2018:47–55. AAAI Press, 2018. https://doi.org/10.1609/icaps.v28i1.13875.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 141 |
Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 143 |
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 198 |
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2018 |
Published |
Conference Paper |
IST-REx-ID: 10883 |
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 10417 |
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2018. https://doi.org/10.1145/3158119.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 24 |
Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 25 |
Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS