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.

331 Publications


2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee K, Novotny P, Zikelic D. 2017. Stochastic invariants for probabilistic termination. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 52. 145–160.
View | DOI | Download (ext.)
 

2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426. 201–221.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2017 | Journal Article | IST-REx-ID: 467   OA
Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.
View | Files available | DOI | Download (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 950   OA
Avni G, Henzinger TA, Chonev VK. 2017. Infinite-duration bidding games. CONCUR: Concurrency Theory, LIPIcs, vol. 85. 17.
View | Files available | DOI | arXiv
 

2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee K, Henzinger M, Svozil A. 2017. Faster algorithms for mean payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee K, Fu H, Goharshady A. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427. 41–63.
View | DOI | Download (ext.)
 

2017 | Journal Article | IST-REx-ID: 653
Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.
View | DOI
 

2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee K, Henzinger TA, Otop J. 2017. Bidirectional nested weighted automata. 28th International Conference on Concurrency Theory, CONCUR, LIPIcs, vol. 85.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 716
Chatterjee K, Velner Y. 2017. The complexity of mean-payoff pushdown games. Journal of the ACM. 64(5), 34.
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee K, Goharshady A, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482. 59–66.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee K, Henzinger M, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3).
View | Files available | DOI
 

2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83.
View | Files available | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426. 118–139.
View | DOI | Download (ext.)
 

2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82. 18.
View | Files available | DOI
 

2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Strong amplifiers of natural selection, IST Austria,p.
View | Files available | DOI
 

2017 | Journal Article | IST-REx-ID: 717
Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.
View | Files available | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1200   OA
Hilbe C, Traulsen A. 2016. 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. 19, 29–31.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1325   OA
Brázdil T, Forejt V, Kučera A, Novotny P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1426   OA
Chakra M, Hilbe C, Traulsen A. 2016. Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites. Royal Society Open Science. 3(5).
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016. 3225–3232.
View | Files available
 

2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee K, Fu H, Novotny P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22. 327–342.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1326   OA
Brázdil T, Kučera A, Novotny P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938. 32–49.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1333   OA
Milinski M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. 2016. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. 7.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1340   OA
Hansen K, Ibsen-Jensen R, Koucký M. 2016. The big match in small space. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928. 64–76.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285. 1432–1439.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016. 247–256.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1477
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January. 172–179.
View | Files available | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1245
Pandey V, Chatterjee K. 2016. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26. 365–368.
View | DOI
 

2016 | Journal Article | IST-REx-ID: 1322   OA
Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10).
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotny P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems 1465–1466.
View | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1389   OA
Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science 515–524.
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1423   OA
Baek S, Jeong H, Hilbe C, Nowak M. 2016. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 6.
View | Files available | DOI
 

2016 | Journal Article | IST-REx-ID: 1529
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
View | Files available | DOI | Download (ext.) | arXiv
 

2016 | Technical Report | IST-REx-ID: 5451   OA
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers of natural selection, IST Austria, 34p.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1093
Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5449
Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on undirected population structures: Comets beat stars, IST Austria, 22p.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1068   OA
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1070   OA
Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55.
View | Files available | DOI
 

2016 | Conference Paper | IST-REx-ID: 1138   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 76–85.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1140   OA
Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, 197–206.
View | DOI | Download (ext.)
 

2016 | Conference Paper | IST-REx-ID: 1335   OA
Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837. 23–38.
View | DOI | Download (ext.)
 

2016 | Thesis | IST-REx-ID: 1397
Chmelik M. 2016. Algorithms for partially observable markov decision processes, IST Austria, 232p.
View
 

2016 | Journal Article | IST-REx-ID: 1380   OA
Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem. Journal of the ACM. 63(3).
View | DOI | Download (ext.)
 

2016 | Journal Article | IST-REx-ID: 1518   OA
Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.
View | Files available | DOI
 

2016 | Technical Report | IST-REx-ID: 5445   OA
Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural analysis, IST Austria, 33p.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed