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.

Krishnendu Chatterjee

Laura Schmid

Amir Goharshady

Pepa Tkadlec

Viktor Toman

Ismael Jecker

Djordje Zikelic

Maria Kleshnina

Christian Hilbe

Johannes Reiter

Hongfei Fu

Jan Kretinsky

Joost Katoen

Sasha Rubin

Rasmus Ibsen-Jensen

Ventsislav Chonev

Florian Horn

Petr Novotny

Mathieu Tracol

Benjamin Aminof

Tadeas Priklopil

Andreas Pavlogiannis

Martin Chmelik



332 Publications

2019 | Conference Paper | IST-REx-ID: 6490
Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772. 400–408.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140. 7.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs (eds. C. Enea & R. Piskac). 11388, 468–490.
View | DOI
 
2019 | 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.
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019). 40th ACM Conference on Programming Language Design and Implementation 204–220.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138. 11.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140. 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. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785. 109–128.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
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.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni G, Bloem R, Chatterjee K, Henzinger TA, Konighofer B, Pranger S. 2019. Run-time optimization for learned controllers through quantitative games. 31st International Conference on Computer-Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 11561. 630–649.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed