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
Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 6887   OA
Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 7, doi:10.4230/LIPICS.CONCUR.2019.7.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. Termination of Nondeterministic Probabilistic Programs. Edited by Constantin Enea and Ruzica Piskac, vol. 11388, Springer, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 7014
Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, ACM, 2019, p. 20, doi:10.1145/3339984.
View | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6175   OA
Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” 40th ACM Conference on Programming Language Design and Implementation (PLDI 2019), Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6884   OA
Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 11, doi:10.4230/LIPICS.MFCS.2019.11.
View | Files available | DOI | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6889   OA
Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 6, doi:10.4230/LIPICS.CONCUR.2019.6.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6942   OA
Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” 16th International Conference on Quantitative Evaluation of Systems, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:10.1007/978-3-030-30281-8_7.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6056   OA
Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019, p. 8751326, doi:10.1109/BLOC.2019.8751326.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6462   OA
Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.” 31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6378   OA
Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 374–81, doi:10.1145/3297280.3297319.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6380   OA
Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, ACM, 2019, p. 53, doi:10.1145/3290366.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 27, doi:10.4230/LIPICS.CONCUR.2019.27.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM.
View | Files available | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6836
Hauser, Oliver P., et al. “Social Dilemmas among Unequals.” Nature, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:10.1038/s41586-019-1488-5.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6918
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, Elsevier, 2019, p. 106665, doi:10.1016/j.ress.2019.106665.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, Tomáš, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. F138033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, Royal Society, 2018, doi:10.1098/rsif.2018.0073.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
View | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 11, doi:10.4230/LIPIcs.CONCUR.2018.11.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 310   OA
Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety and Diameter. ACM, 2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 454   OA
Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications, vol. 9, no. 1, Nature Publishing Group, 2018, p. 555, doi:10.1038/s41467-017-02721-8.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5967
Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
View | DOI
 
2018 | Journal Article | IST-REx-ID: 6009   OA
Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, Association for Computing Machinery (ACM), 2018, p. 9, doi:10.1145/3210257.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5993   OA
Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, Association for Computing Machinery (ACM), 2018, p. 7, doi:10.1145/3174800.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 6340   OA
Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48.
View | Files available | arXiv
 
2018 | Journal Article | IST-REx-ID: 738   OA
Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 79   OA
Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.
View | DOI | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 86
Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
View | DOI
 
2018 | Journal Article | IST-REx-ID: 157
Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 25
Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662 .
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 311   OA
Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 141   OA
Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp. 178–97, doi:10.1007/978-3-319-96142-2_13.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 2   OA
Hilbe, Christian, et al. “Indirect Reciprocity with Private Noisy and Incomplete Information.” PNAS, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:10.1073/pnas.1810565115 .
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2018 | Conference Paper | IST-REx-ID: 297   OA
Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 293
Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 325   OA
Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 34   OA
Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 419
Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5679   OA
Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5751   OA
Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, Springer Nature, 2018, p. 71, doi:10.1038/s42003-018-0078-7.
View | Files available | DOI
 
2018 | Preprint | IST-REx-ID: 5977   OA
Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” ArXiv, ArXiv.
View | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 1065   OA
Chatterjee, Krishnendu, and Georg F. Osang. “Pushdown Reachability with Constant Treewidth.” Information Processing Letters, vol. 122, Elsevier, 2017, pp. 25–29, doi:10.1016/j.ipl.2017.02.003.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1407
Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, Elsevier, 2017, pp. 230–53, doi:10.1016/j.nahs.2016.04.006.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Journal Article | IST-REx-ID: 465
Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 681   OA
Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 744
Priklopil, Tadeas, et al. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology, vol. 433, Elsevier, 2017, pp. 64–72, doi:10.1016/j.jtbi.2017.08.025.
View | DOI
 
2017 | Thesis | IST-REx-ID: 821   OA
Pavlogiannis, Andreas. Algorithmic Advances in Program Analysis and Their Applications. IST Austria, 2017, doi:10.15479/AT:ISTA:th_854.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1009   OA
Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” Proceedings of the 31st AAAI Conference on Artificial Intelligence, vol. 5, AAAI Press, 2017, pp. 3725–32.
View | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1011   OA
Chatterjee, Krishnendu, et al. Faster Algorithms for Weighted Recursive State Machines. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:10.1007/978-3-662-54434-1_11.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 1080   OA
Reiter, Johannes, et al. “Reconstructing Metastatic Seeding Patterns of Human Cancers.” Nature Communications, vol. 8, 14114, Nature Publishing Group, 2017, doi:10.1038/ncomms14114.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1294
Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” Journal of Computer and System Sciences, vol. 84, Elsevier, 2017, pp. 144–70, doi:10.1016/j.jcss.2016.09.009.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 466
Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, International Federation of Computational Logic, 2017, p. 15, doi:10.23638/LMCS-13(2:15)2017.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 512
Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, Nature Publishing Group, 2017, p. 82, doi:10.1038/s41598-017-00107-w.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 1066
Chatterjee, Krishnendu, et al. “Quantitative Fair Simulation Games.” Information and Computation, vol. 254, no. 2, Elsevier, 2017, pp. 143–66, doi:10.1016/j.ic.2016.10.006.
View | Files available | DOI
 
2017 | Technical Report | IST-REx-ID: 5455   OA
Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.
View | Files available | DOI
 
2017 | Book Chapter | IST-REx-ID: 625
Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
View | DOI
 
2017 | Journal Article | IST-REx-ID: 699   OA
Veller, Carl, et al. “The Red Queen and King in Finite Populations.” PNAS, vol. 114, no. 27, National Academy of Sciences, 2017, pp. E5396–405, doi:10.1073/pnas.1702020114.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2017 | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica, vol. 54, no. 6, Springer, 2017, pp. 543–44, doi:10.1007/s00236-017-0299-0.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 1194   OA
Chatterjee, Krishnendu, et al. Stochastic Invariants for Probabilistic Termination. Vol. 52, no. 1, ACM, 2017, pp. 145–60, doi:10.1145/3009837.3009873.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 467
Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, ACM, 2017, p. 31, doi:10.1145/3152769.
View | Files available | DOI | Download (ext.) | arXiv
 
2017 | Technical Report | IST-REx-ID: 5456   OA
Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 551   OA
Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 645   OA
Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 671   OA
Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2017 | Conference Paper | IST-REx-ID: 950   OA
Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 17, doi:10.4230/LIPIcs.CONCUR.2017.21.
View | Files available | DOI | arXiv
 
2017 | Conference Paper | IST-REx-ID: 552   OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 653
Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 639   OA
Chatterjee, Krishnendu, et al. Non-Polynomial Worst Case Analysis of Recursive Programs. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 41–63, doi:10.1007/978-3-319-63390-9_3.
View | DOI | Download (ext.)
 
2017 | Journal Article | IST-REx-ID: 684   OA
Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 711   OA
Chatterjee, Krishnendu, et al. Bidirectional Nested Weighted Automata. Vol. 85, 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.5.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 716
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM, vol. 64, no. 5, ACM, 2017, p. 34, doi:10.1145/3121408.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 949   OA
Chatterjee, Krishnendu, et al. JTDec: A Tool for Tree Decompositions in Soot. Edited by Deepak D’Souza, vol. 10482, Springer, 2017, pp. 59–66, doi:10.1007/978-3-319-68167-2_4.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 464   OA
Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 553   OA
Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.
View | Files available | DOI | Download (ext.)
 
2017 | Research Data | IST-REx-ID: 5559
Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection. IST Austria, 2017, doi:10.15479/AT:ISTA:51.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 628   OA
Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6519   OA
Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, p. 18, doi:10.4230/LIPICS.CSL.2017.18.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 717   OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences, vol. 88, Academic Press, 2017, pp. 236–59, doi:10.1016/j.jcss.2017.04.005.
View | Files available | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1200   OA
Hilbe, Christian, and Arne 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, Elsevier, 2016, pp. 29–31, doi:10.1016/j.plrev.2016.10.004.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1325   OA
Brázdil, Tomáš, et al. Stability in Graphs and Games. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.10.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1426   OA
Chakra, Maria, et al. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.” Royal Society Open Science, vol. 3, no. 5, 160036, Royal Society, The, 2016, doi:10.1098/rsos.160036.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp. 3225–32.
View | Files available
 
2016 | Conference Paper | IST-REx-ID: 1438
Chatterjee, Krishnendu, et al. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Vol. 20–22, ACM, 2016, pp. 327–42, doi:10.1145/2837614.2837639.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1326   OA
Brázdil, Tomáš, et al. Optimizing the Expected Mean Payoff in Energy Markov Decision Processes. Vol. 9938, Springer, 2016, pp. 32–49, doi:10.1007/978-3-319-46520-3_3.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1333   OA
Milinski, Manfred, et al. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.” Nature Communications, vol. 7, 10915, Nature Publishing Group, 2016, doi:10.1038/ncomms10915.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1340   OA
Hansen, Kristoffer, et al. The Big Match in Small Space. Vol. 9928, Springer, 2016, pp. 64–76, doi:10.1007/978-3-662-53354-3_6.
View | DOI | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 478   OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 480   OA
Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:10.1145/2933575.2934513.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1093
Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1182   OA
Chatterjee, Krishnendu, et al. Robust Draws in Balanced Knockout Tournaments. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.
View | Files available | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1245
Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” Proceedings of the ACM Conference on Computer Supported Cooperative Work, vol. 26, no. Februar-2016, ACM, 2016, pp. 365–68, doi:10.1145/2818052.2869122.
View | DOI
 
2016 | Journal Article | IST-REx-ID: 1322   OA
Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” PLoS One, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:10.1371/journal.pone.0163867.
View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1327   OA
Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–66.
View | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1389   OA
Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” LICS ’16, IEEE, 2016, pp. 515–24, doi:10.1145/2933575.2934548.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1423   OA
Baek, Seung, et al. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.” Scientific Reports, vol. 6, 25676, Nature Publishing Group, 2016, doi:10.1038/srep25676.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1529
Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” Artificial Intelligence, vol. 234, Elsevier, 2016, pp. 26–48, doi:10.1016/j.artint.2016.01.007.
View | Files available | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed