en
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: 6887 
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140, p. 7.
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 7158
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, p. 23, 2019.
View
| DOI
2019 | Conference Paper | IST-REx-ID: 6175
P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Phoenix, AZ, United States, 2019, pp. 204–220.
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6884
G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138, p. 11.
View
| Files available
| DOI
| arXiv
2019 | Conference Paper | IST-REx-ID: 6889
K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 6.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6942
P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in 16th International Conference on Quantitative Evaluation of Systems, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.
View
| DOI
| Download (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6056
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019, p. 8751326.
View
| DOI
| Download (ext.)
| arXiv
2019 | Conference Paper | IST-REx-ID: 6462
G. Avni, R. Bloem, K. Chatterjee, T. A. Henzinger, B. Konighofer, and S. Pranger, “Run-time optimization for learned controllers through quantitative games,” in 31st International Conference on Computer-Aided Verification, New York, NY, United States, 2019, vol. 11561, pp. 630–649.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6378
K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 374–381.
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 6380
K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, p. 53, 2019.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6885
K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140, p. 27.
View
| Files available
| DOI
2019 | Conference Paper | IST-REx-ID: 6780
M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece.
View
| Files available
| Download (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 6836
O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” Nature, vol. 572, no. 7770, pp. 524–527, 2019.
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 143
T. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194.
View
| DOI
| Download (ext.)
2018 | Journal Article | IST-REx-ID: 198
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140, 2018.
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 35
K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View
| Download (ext.)
| arXiv