Please note that IST Research Explorer 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, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 7, doi:10.4230/LIPICS.CONCUR.2019.7.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. Termination of Nondeterministic Probabilistic Programs. Edited by Constantin Enea and Ruzica Piskac, vol. 11388, Springer, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
View | DOI
 

2019 | Journal Article | IST-REx-ID: 7014
Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, ACM, 2019, p. 20, doi:10.1145/3339984.
View | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 11, doi:10.4230/LIPICS.MFCS.2019.11.
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 6, doi:10.4230/LIPICS.CONCUR.2019.6.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6942   OA
Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019, p. 8751326, doi:10.1109/BLOC.2019.8751326.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.” 31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 374–81, doi:10.1145/3297280.3297319.
View | Files available | DOI
 

2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, ACM, 2019, p. 53, doi:10.1145/3290366.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 27, doi:10.4230/LIPICS.CONCUR.2019.27.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM.
View | Files available | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6836
Hauser, Oliver P., et al. “Social Dilemmas among Unequals.” Nature, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:10.1038/s41586-019-1488-5.
View | Files available | DOI
 

2019 | Journal Article | IST-REx-ID: 6918
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, Elsevier, 2019, p. 106665, doi:10.1016/j.ress.2019.106665.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
View | DOI | Download (ext.)
 

2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, Royal Society, 2018, doi:10.1098/rsif.2018.0073.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
View | Download (ext.) | arXiv
 

2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.
View | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed