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.

333 Publications


2019 | Conference Paper | IST-REx-ID: 6490
The treewidth of smart contracts
K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 6887   OA
Near-linear time algorithms for Streett objectives in graphs and MDPs
K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 7.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 5948
Termination of nondeterministic probabilistic programs
H. Fu, K. Chatterjee, 11388 (2019) 468–490.
View | DOI
 

2019 | Journal Article | IST-REx-ID: 7014
Non-polynomial worst-case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019) 20.
View | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 7158
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019) 23.
View | DOI
 

2019 | Conference Paper | IST-REx-ID: 6175   OA
Cost analysis of nondeterministic probabilistic programs
P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Association for Computing Machinery, 2019, pp. 204–220.
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6884   OA
Bidding mechanisms in graph games
G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 11.
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6889   OA
Combinations of Qualitative Winning for Stochastic Parity Games
K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 6.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6942   OA
Strategy representation by decision trees with linear classifiers
P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 109–128.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6056   OA
Probabilistic smart contracts: Secure randomness on the blockchain
K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019, p. 8751326.
View | DOI | Download (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6462   OA
Run-time optimization for learned controllers through quantitative games
G. Avni, R. Bloem, K. Chatterjee, T.A. Henzinger, B. Konighofer, S. Pranger, in:, 31st International Conference on Computer-Aided Verification, Springer, 2019, pp. 630–649.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6378   OA
Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving
K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 374–381.
View | Files available | DOI
 

2019 | Journal Article | IST-REx-ID: 6380   OA
Efficient parameterized algorithms for data packing
K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019) 53.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6885   OA
Long-run average behavior of vector addition systems with states
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 27.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6780   OA
Modular verification for almost-sure termination of probabilistic programs
M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, n.d.
View | Files available | Download (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6836
Social dilemmas among unequals
O.P. Hauser, C. Hilbe, K. Chatterjee, M.A. Nowak, Nature 572 (2019) 524–527.
View | Files available | DOI
 

2019 | Journal Article | IST-REx-ID: 6918
An efficient algorithm for computing network reliability in small treewidth
A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2019) 106665.
View | DOI
 

2018 | Conference Paper | IST-REx-ID: 143   OA
Efficient algorithms for asymptotic bounds on termination time in VASS
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194.
View | DOI | Download (ext.)
 

2018 | Journal Article | IST-REx-ID: 198   OA
Language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 35   OA
Algorithms and conditional lower bounds for planning problems
K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
View | Download (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Export / Embed