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.




332 Publications

2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee K, Dvorák W, Henzinger M, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:7. doi:10.4230/LIPICS.CONCUR.2019.7
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. Enea C, Piskac R, eds. 2019;11388:468-490. doi:10.1007/978-3-030-11245-5_22
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4):20. doi:10.1145/3339984
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:11. doi:10.4230/LIPICS.MFCS.2019.11
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:6. doi:10.4230/LIPICS.CONCUR.2019.6
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6942   OA
Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy representation by decision trees with linear classifiers. In: 16th International Conference on Quantitative Evaluation of Systems. Vol 11785. Springer Nature; 2019:109-128. doi:10.1007/978-3-030-30281-8_7
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL):53. doi:10.1145/3290366
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :374-381. doi:10.1145/3297280.3297319
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed