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 M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6490 |
Chatterjee K, Goharshady AK, Goharshady EK. 2019. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Conference Paper |
IST-REx-ID: 6378 |
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Conference Paper |
IST-REx-ID: 6175 |
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 7158 |
Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |
Published |
Journal Article |
IST-REx-ID: 7014 |
Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 6380 |
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53.
[Published Version]
View
| Files available
| DOI
2019 |
Published |
Conference Paper |
IST-REx-ID: 6056 |
Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
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: 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: 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 |
Conference Paper |
IST-REx-ID: 325 |
Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 34 |
Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2018, 47–55.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
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: 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
| 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: 10883 |
Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 10417 |
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2018. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.
[Published Version]
View
| Files available
| DOI
| arXiv
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