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
K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
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 | Conference Paper | IST-REx-ID: 5948
H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” vol. 11388. Springer, pp. 468–490, 2019.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, p. 20, 2019.
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
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   OA
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   OA
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   OA
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   OA
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   OA
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   OA
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   OA
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   OA
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   OA
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
 
2019 | Journal Article | IST-REx-ID: 6918
A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193, p. 106665, 2019.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 143   OA
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   OA
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   OA
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
 
2018 | Book Chapter | IST-REx-ID: 59
R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
K. Chatterjee, A. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies.,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118, p. 11.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
K. Chatterjee, A. Elgyütt, P. Novotny, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 310   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, 2018, pp. 2341–2356.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 454   OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1, p. 555, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5967
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
View | DOI
 
2018 | Journal Article | IST-REx-ID: 6009   OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, p. 9, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5993   OA
K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, p. 7, 2018.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6340   OA
A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.
View | Files available | arXiv
 
2018 | Journal Article | IST-REx-ID: 738   OA
K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive analysis of real time scheduling with graph games,” Real-Time Systems, vol. 54, no. 1, pp. 166–207, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 79   OA
S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.
View | DOI | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 86
K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.
View | DOI
 
2018 | Journal Article | IST-REx-ID: 157
C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” Nature, vol. 559, no. 7713, pp. 246–249, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 311   OA
K. Chatterjee, A. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 141   OA
K. Chatterjee, M. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 2   OA
C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private noisy and incomplete information,” PNAS, vol. 115, no. 48, pp. 12241–12246, 2018.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 297   OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 293
M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2, pp. 397–404, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 325   OA
S. Agrawal, K. Chatterjee, and P. Novotny, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 34   OA
K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 419
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2, pp. 469–477, 2018.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5679   OA
M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751   OA
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1, p. 71, 2018.
View | Files available | DOI
 
2018 | Preprint | IST-REx-ID: 5977   OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational Approaches for Stochastic Shortest Path on Succinct MDPs,” ArXiv. ArXiv.
View | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 1065   OA
K. Chatterjee and G. F. Osang, “Pushdown reachability with constant treewidth,” Information Processing Letters, vol. 122, pp. 25–29, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1407
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, pp. 230–253, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 465
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 681   OA
K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254, pp. 296–315, 2017.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 744
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433, pp. 64–72, 2017.
View | DOI
 
2017 | Thesis | IST-REx-ID: 821   OA
A. Pavlogiannis, Algorithmic advances in program analysis and their applications. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1009   OA
K. Chatterjee, P. Novotny, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in Proceedings of the 31st AAAI Conference on Artificial Intelligence, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.
View | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1011   OA
K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “ Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1080   OA
J. Reiter et al., “Reconstructing metastatic seeding patterns of human cancers,” Nature Communications, vol. 8, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1294
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84, pp. 144–170, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 466
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2, p. 15, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 512
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1, p. 82, 2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1066
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, “Quantitative fair simulation games,” Information and Computation, vol. 254, no. 2, pp. 143–166, 2017.
View | Files available | DOI
 
2017 | Technical Report | IST-REx-ID: 5455   OA
K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.
View | Files available | DOI
 
2017 | Book Chapter | IST-REx-ID: 625
K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 699   OA
C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” PNAS, vol. 114, no. 27, pp. E5396–E5405, 2017.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2017 | Journal Article | IST-REx-ID: 719
K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6, pp. 543–544, 2017.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 1194   OA
K. Chatterjee, P. Novotny, and D. Zikelic, “Stochastic invariants for probabilistic termination,” presented at the POPL: Principles of Programming Languages, Paris, France, 2017, vol. 52, no. 1, pp. 145–160.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 467
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, p. 31, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Technical Report | IST-REx-ID: 5456   OA
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 551   OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 645   OA
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 671   OA
C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18, pp. 4715–4720, 2017.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2017 | Conference Paper | IST-REx-ID: 950   OA
G. Avni, T. A. Henzinger, and V. K. Chonev, “Infinite-duration bidding games,” presented at the CONCUR: Concurrency Theory, Berlin, Germany, 2017, vol. 85, p. 17.
View | Files available | DOI | arXiv
 
2017 | Conference Paper | IST-REx-ID: 552   OA
K. Chatterjee, M. Henzinger, and A. Svozil, “Faster algorithms for mean payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 653
A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3, pp. 358–366, 2017.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 639   OA
K. Chatterjee, H. Fu, and A. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 684   OA
K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2, pp. 420–452, 2017.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 711   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 716
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5, p. 34, 2017.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 949   OA
K. Chatterjee, A. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 464   OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 553   OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
View | Files available | DOI | Download (ext.)
 
2017 | Research Data | IST-REx-ID: 5559
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak , Strong amplifiers of natural selection. IST Austria, 2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 628   OA
K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6519   OA
K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82, p. 18.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 717   OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88, pp. 236–259, 2017.
View | Files available | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1200   OA
C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” Physics of Life Reviews, vol. 19, pp. 29–31, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1325   OA
T. Brázdil, V. Forejt, A. Kučera, and P. Novotny, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1426   OA
M. Chakra, C. Hilbe, and A. Traulsen, “Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites,” Royal Society Open Science, vol. 3, no. 5, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 
2016 | Conference Paper | IST-REx-ID: 1438
K. Chatterjee, H. Fu, P. Novotny, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1326   OA
T. Brázdil, A. Kučera, and P. Novotny, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1333   OA
M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, and J. Marotzke, “Humans choose representatives who enforce cooperation in social dilemmas through extortion,” Nature Communications, vol. 7, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1340   OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 478   OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 480   OA
K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1477
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5, pp. 878–911, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1093
P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1182   OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
View | Files available | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1245
V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in Proceedings of the ACM Conference on Computer Supported Cooperative Work, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.
View | DOI
 
2016 | Journal Article | IST-REx-ID: 1322   OA
C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10, 2016.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1327   OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotny, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
View | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1389   OA
V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in LICS ’16, New York, NY, USA, 2016, pp. 515–524.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1423   OA
S. Baek, H. Jeong, C. Hilbe, and M. Nowak, “Comparing reactive and memory-one strategies of direct reciprocity,” Scientific Reports, vol. 6, 2016.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1529
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234, pp. 26–48, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed