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.

340 Publications


2018 | Conference Paper | IST-REx-ID: 5977   OA
K. Chatterjee, H. Fu, A. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.
View | DOI | Download (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 5751
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, 2018.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 744   OA
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 | Files available | DOI | PubMed | Europe PMC
 

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   OA
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 | Thesis | IST-REx-ID: 821   OA
A. Pavlogiannis, Algorithmic advances in program analysis and their applications. IST Austria, 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 | 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: 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 | 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 | 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   OA
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, 2017.
View | Files available | DOI
 

2017 | Book Chapter | IST-REx-ID: 625   OA
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 | Files available | DOI
 

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: 512   OA
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 | 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: 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   OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 

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.
View | Files available | DOI | arXiv
 

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 | 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   OA
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 | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716   OA
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 | Download (ext.) | arXiv
 

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 | 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 | Files available | DOI | Download (ext.) | arXiv
 

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 | 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: 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.
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.)
 

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
 

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: 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: 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 | 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: 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.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed