Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
LibreCat: https://research-explorer.ista.ac.at/record/10629
DOI: 10.4230/LIPIcs.FSTTCS.2021.42

Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.”10.1137/1.9781611976465.38__Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.
LibreCat: https://research-explorer.ista.ac.at/record/10694
DOI: 10.1137/1.9781611976465.38
arXiv: 2005.06636

Tomásek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.”10.24963/ijcai.2021/575__30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.
LibreCat: https://research-explorer.ista.ac.at/record/10847
DOI: 10.24963/ijcai.2021/575

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.
LibreCat: https://research-explorer.ista.ac.at/record/9296
DOI: 10.1007/978-3-030-68211-8_18
arXiv: 2101.03928

Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.
LibreCat: https://research-explorer.ista.ac.at/record/9403

Bansal, Suguman, et al. “On Satisficing in Quantitative Games.”10.1007/978-3-030-72016-2__27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2.
LibreCat: https://research-explorer.ista.ac.at/record/12767
DOI: 10.1007/978-3-030-72016-2
arXiv: 2101.02594

Lechner, Mathias, et al. “Infinite Time Horizon Safety of Bayesian Neural Networks.”10.48550/arXiv.2111.03165__35th Conference on Neural Information Processing Systems, 2021, doi:10.48550/arXiv.2111.03165.
LibreCat: https://research-explorer.ista.ac.at/record/10667
DOI: 10.48550/arXiv.2111.03165
arXiv: 2111.03165

Zeiner, Martin, et al. “Optimal Strategies for Selecting Coordinators.”10.1016/j.dam.2020.10.022__Discrete Applied Mathematics, vol. 289, no. 1, Elsevier, 2021, pp. 392–415, doi:10.1016/j.dam.2020.10.022.
LibreCat: https://research-explorer.ista.ac.at/record/8793
DOI: 10.1016/j.dam.2020.10.022
WoS: 000596823800035

Kleshnina, Maria, et al. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.”10.1371/journal.pcbi.1008523__PLoS Computational Biology, vol. 17, no. 4, e1008523, Public Library of Science, 2021, doi:10.1371/journal.pcbi.1008523.
LibreCat: https://research-explorer.ista.ac.at/record/9381
DOI: 10.1371/journal.pcbi.1008523
WoS: 000639711200001

Tkadlec, Josef, et al. “Fast and Strong Amplifiers of Natural Selection.”10.1038/s41467-021-24271-w__Nature Communications, vol. 12, no. 1, 4009, Springer Nature, 2021, doi:10.1038/s41467-021-24271-w.
LibreCat: https://research-explorer.ista.ac.at/record/9640
DOI: 10.1038/s41467-021-24271-w
WoS: 000671752100003
PMID: 34188036

Wang, Jinyi, et al. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”10.1145/3453483.3454102__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–86, doi:10.1145/3453483.3454102.
LibreCat: https://research-explorer.ista.ac.at/record/9646
DOI: 10.1145/3453483.3454102
WoS: 000723661700076
arXiv: 2011.14617

Asadi, Ali, et al. “Polynomial Reachability Witnesses via Stellensätze.”10.1145/3453483.3454076__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–87, doi:10.1145/3453483.3454076.
LibreCat: https://research-explorer.ista.ac.at/record/9645
DOI: 10.1145/3453483.3454076
WoS: 000723661700050

Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.”10.1109/LICS52264.2021.9470739__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470739.
LibreCat: https://research-explorer.ista.ac.at/record/10002
DOI: 10.1109/LICS52264.2021.9470739
WoS: 000947350400089
arXiv: 2104.07466

Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”10.1109/LICS52264.2021.9470595__Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13, doi:10.1109/LICS52264.2021.9470595.
LibreCat: https://research-explorer.ista.ac.at/record/10004
DOI: 10.1109/LICS52264.2021.9470595
WoS: 000947350400036
arXiv: 2104.07278

Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.”10.4230/LIPIcs.STACS.2021.44__38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044

Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.”10.1007/978-3-030-81685-8_16__33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
LibreCat: https://research-explorer.ista.ac.at/record/9987
DOI: 10.1007/978-3-030-81685-8_16
WoS: 000698732400016
arXiv: 2105.06424

Bui, Truc Lam, et al. “The Reads-from Equivalence for the TSO and PSO Memory Models.”10.1145/3485541__Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA, 164, Association for Computing Machinery, 2021, doi:10.1145/3485541.
LibreCat: https://research-explorer.ista.ac.at/record/10191
DOI: 10.1145/3485541
arXiv: 2011.11763

Toman, Viktor. Improved Verification Techniques for Concurrent Systems. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10199.
LibreCat: https://research-explorer.ista.ac.at/record/10199
DOI: 10.15479/at:ista:10199

Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.”10.1016/j.artint.2021.103499__Artificial Intelligence, vol. 297, no. 8, 103499, Elsevier, 2021, doi:10.1016/j.artint.2021.103499.
LibreCat: https://research-explorer.ista.ac.at/record/9293
DOI: 10.1016/j.artint.2021.103499
WoS: 000657537500003
arXiv: 1804.07031

Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”10.1007/s10703-021-00373-5__Formal Methods in System Design, vol. 57, Springer, 2021, pp. 401–28, doi:10.1007/s10703-021-00373-5.
LibreCat: https://research-explorer.ista.ac.at/record/9393
DOI: 10.1007/s10703-021-00373-5
WoS: 000645490300001
arXiv: 1504.07384

Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.”10.1007/978-3-030-90870-6_33__24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.
LibreCat: https://research-explorer.ista.ac.at/record/10414
DOI: 10.1007/978-3-030-90870-6_33
WoS: 000758218600033
arXiv: 2108.02188

Chatterjee, Krishnendu, et al. “Proving Non-Termination by Program Reversal.”10.1145/3453483.3454093__Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1033–48, doi:10.1145/3453483.3454093.
LibreCat: https://research-explorer.ista.ac.at/record/9644
DOI: 10.1145/3453483.3454093
WoS: 000723661700067
arXiv: 2104.01189

Chatterjee, Krishnendu, et al. RevTerm. Association for Computing Machinery, 2021, doi:10.1145/3410304.
LibreCat: https://research-explorer.ista.ac.at/record/15284
DOI: 10.1145/3410304

Goharshady, Amir Kafshdar. Parameterized and Algebro-Geometric Advances in Static Program Analysis. Institute of Science and Technology Austria, 2021, doi:10.15479/AT:ISTA:8934.
LibreCat: https://research-explorer.ista.ac.at/record/8934
DOI: 10.15479/AT:ISTA:8934

Schmid, Laura. Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10293.
LibreCat: https://research-explorer.ista.ac.at/record/10293
DOI: 10.15479/at:ista:10293

Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.”10.1038/s41598-021-96932-1__Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.
LibreCat: https://research-explorer.ista.ac.at/record/9997
DOI: 10.1038/s41598-021-96932-1
WoS: 000692406400018
PMID: 34465830

Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.”10.1038/s41562-021-01114-8__Nature Human Behaviour, vol. 5, no. 10, Springer Nature, 2021, pp. 1292–1302, doi:10.1038/s41562-021-01114-8.
LibreCat: https://research-explorer.ista.ac.at/record/9402
DOI: 10.1038/s41562-021-01114-8
WoS: 000650304000002
PMID: 33986519

Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.”10.4230/LIPIcs.OPODIS.2019.21__Proceedings of the 23rd International Conference on Principles of Distributed Systems, vol. 153, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2019.21.
LibreCat: https://research-explorer.ista.ac.at/record/7346
DOI: 10.4230/LIPIcs.OPODIS.2019.21
arXiv: 1906.00110

Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”10.4230/LIPIcs.CONCUR.2020.23__31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.
LibreCat: https://research-explorer.ista.ac.at/record/8600
DOI: 10.4230/LIPIcs.CONCUR.2020.23
arXiv: 2007.08917

Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.”10.4230/LIPIcs.MFCS.2020.22__45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.22.
LibreCat: https://research-explorer.ista.ac.at/record/8533
DOI: 10.4230/LIPIcs.MFCS.2020.22
arXiv: 2007.02894

Jecker, Ismael R., et al. “Unary Prime Languages.”10.4230/LIPIcs.MFCS.2020.51__45th International Symposium on Mathematical Foundations of Computer Science, vol. 170, 51:1-51:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.MFCS.2020.51.
LibreCat: https://research-explorer.ista.ac.at/record/8534
DOI: 10.4230/LIPIcs.MFCS.2020.51

Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic Games.”10.1145/3373718.3394761__Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Association for Computing Machinery, 2020, pp. 102–15, doi:10.1145/3373718.3394761.
LibreCat: https://research-explorer.ista.ac.at/record/7955
DOI: 10.1145/3373718.3394761
WoS: 000665014900010
arXiv: 1908.05106

Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.”10.1371/journal.pcbi.1008402__PLOS Computational Biology, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1008402.
LibreCat: https://research-explorer.ista.ac.at/record/8767
DOI: 10.1371/journal.pcbi.1008402
WoS: 000591317200004

Kleshnina, Maria, et al. “Prioritised Learning in Snowdrift-Type Games.”10.3390/math8111945__Mathematics, vol. 8, no. 11, 1945, MDPI, 2020, doi:10.3390/math8111945.
LibreCat: https://research-explorer.ista.ac.at/record/8789
DOI: 10.3390/math8111945
WoS: 000593962100001

Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”10.1109/TCAD.2020.3012803__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 39, no. 11, IEEE, 2020, pp. 3981–92, doi:10.1109/TCAD.2020.3012803.
LibreCat: https://research-explorer.ista.ac.at/record/8788
DOI: 10.1109/TCAD.2020.3012803
WoS: 000587712700069

Avni, Guy, et al. “All-Pay Bidding Games on Graphs.”10.1609/aaai.v34i02.5546__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.
LibreCat: https://research-explorer.ista.ac.at/record/9197
DOI: 10.1609/aaai.v34i02.5546
arXiv: 1911.08360

Milutinovic, Barbara, et al. “Social Immunity Modulates Competition between Coinfecting Pathogens.”10.1111/ele.13458__Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 565–74, doi:10.1111/ele.13458.
LibreCat: https://research-explorer.ista.ac.at/record/7343
DOI: 10.1111/ele.13458
WoS: 000507515900001

Milutinovic, Barbara, et al. Social Immunity Modulates Competition between Coinfecting Pathogens. Dryad, 2020, doi:10.5061/DRYAD.CRJDFN318.
LibreCat: https://research-explorer.ista.ac.at/record/13060
DOI: 10.5061/DRYAD.CRJDFN318

Chatterjee, Krishnendu, et al. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” Proceedings of the 30th International Conference on Automated Planning and Scheduling, vol. 30, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.
LibreCat: https://research-explorer.ista.ac.at/record/8193

Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”10.1007/978-3-030-53291-8_21__International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.
LibreCat: https://research-explorer.ista.ac.at/record/8272
DOI: 10.1007/978-3-030-53291-8_21
WoS: 000695272500021
arXiv: 2005.04018

Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.”10.29252/ijmsi.15.2.117__Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, Iranian Academic Center for Education, Culture and Research, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.
LibreCat: https://research-explorer.ista.ac.at/record/8671
DOI: 10.29252/ijmsi.15.2.117
arXiv: 1805.10672

Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”10.1371/journal.pcbi.1007494__PLoS Computational Biology, vol. 16, e1007494, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1007494.
LibreCat: https://research-explorer.ista.ac.at/record/7212
DOI: 10.1371/journal.pcbi.1007494
WoS: 000510916500025
arXiv: 1906.02785

Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7196.
LibreCat: https://research-explorer.ista.ac.at/record/7196
DOI: 10.15479/AT:ISTA:7196

Ibsen-Jensen, Rasmus, et al. Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners. Royal Society, 2020, doi:10.6084/m9.figshare.5973013.v1.
LibreCat: https://research-explorer.ista.ac.at/record/9814
DOI: 10.6084/m9.figshare.5973013.v1

Wang, Peixin, et al. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.”10.1145/3371093__Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, 25, ACM, 2020, doi:10.1145/3371093.
LibreCat: https://research-explorer.ista.ac.at/record/8324
DOI: 10.1145/3371093
arXiv: 1902.04744

Brázdil, Tomás, et al. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.”10.1609/aaai.v34i06.6531__Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06, Association for the Advancement of Artificial Intelligence, 2020, pp. 9794–801, doi:10.1609/aaai.v34i06.6531.
LibreCat: https://research-explorer.ista.ac.at/record/15055
DOI: 10.1609/aaai.v34i06.6531
arXiv: 2002.12086

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.”10.1007/978-3-030-44914-8_5__European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.
LibreCat: https://research-explorer.ista.ac.at/record/7810
DOI: 10.1007/978-3-030-44914-8_5
WoS: 000681656800005

Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”10.1007/978-3-030-59152-6_14__Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.
LibreCat: https://research-explorer.ista.ac.at/record/8728
DOI: 10.1007/978-3-030-59152-6_14
WoS: 000723555700014

Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.”10.1145/3385412.3385969__Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–87, doi:10.1145/3385412.3385969.
LibreCat: https://research-explorer.ista.ac.at/record/8089
DOI: 10.1145/3385412.3385969
WoS: 000614622300045
arXiv: 1902.04373

Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.”10.1016/j.ress.2019.106665__Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.
LibreCat: https://research-explorer.ista.ac.at/record/6918
DOI: 10.1016/j.ress.2019.106665
WoS: 000501641400050
arXiv: 1712.09692

Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”10.4230/LIPICS.CONCUR.2019.7__Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
LibreCat: https://research-explorer.ista.ac.at/record/6887
DOI: 10.4230/LIPICS.CONCUR.2019.7

Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.
LibreCat: https://research-explorer.ista.ac.at/record/6885
DOI: 10.4230/LIPICS.CONCUR.2019.27

Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.
LibreCat: https://research-explorer.ista.ac.at/record/6889
DOI: 10.4230/LIPICS.CONCUR.2019.6

Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.
LibreCat: https://research-explorer.ista.ac.at/record/6884
DOI: 10.4230/LIPICS.MFCS.2019.11
arXiv: 1905.03835

Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.”10.1007/978-3-030-11245-5_22__International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.
LibreCat: https://research-explorer.ista.ac.at/record/5948
DOI: 10.1007/978-3-030-11245-5_22
WoS: 000931943000022
arXiv: 1701.02944

Avni, Guy, et al. “Run-Time Optimization for Learned Controllers through Quantitative Games.”10.1007/978-3-030-25540-4_36__31st International Conference on Computer-Aided Verification, vol. 11561, Springer, 2019, pp. 630–49, doi:10.1007/978-3-030-25540-4_36.
LibreCat: https://research-explorer.ista.ac.at/record/6462
DOI: 10.1007/978-3-030-25540-4_36
WoS: 000491468000036

Hauser, Oliver P., et al. “Social Dilemmas among Unequals.”10.1038/s41586-019-1488-5__Nature, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:10.1038/s41586-019-1488-5.
LibreCat: https://research-explorer.ista.ac.at/record/6836
DOI: 10.1038/s41586-019-1488-5
WoS: 000482219600045

Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.”10.1007/978-3-030-30281-8_7__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.
LibreCat: https://research-explorer.ista.ac.at/record/6942
DOI: 10.1007/978-3-030-30281-8_7
WoS: 000679281300007
arXiv: 1906.08178

Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”10.1007/978-3-030-31784-3_27__International Symposium on Automated Technology for Verification and Analysis, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:10.1007/978-3-030-31784-3_27.
LibreCat: https://research-explorer.ista.ac.at/record/7183
DOI: 10.1007/978-3-030-31784-3_27
WoS: 000723515700027
arXiv: 1907.11010

Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.”10.1038/s42003-019-0373-y__Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.
LibreCat: https://research-explorer.ista.ac.at/record/7210
DOI: 10.1038/s42003-019-0373-y
WoS: 000465425700006
PMID: 31044163

Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”10.1145/3360550__Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, vol. 3, 124, ACM, 2019, doi:10.1145/3360550.
LibreCat: https://research-explorer.ista.ac.at/record/10190
DOI: 10.1145/3360550
arXiv: 1909.00989

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”10.1109/lics.2019.8785706__34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
LibreCat: https://research-explorer.ista.ac.at/record/7402
DOI: 10.1109/lics.2019.8785706
WoS: 000805002800001
arXiv: 1802.03642

Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981

Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.”10.1145/3360555__Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.
LibreCat: https://research-explorer.ista.ac.at/record/6780
DOI: 10.1145/3360555
arXiv: 1901.06087

Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.”10.1145/3290366__Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366.
LibreCat: https://research-explorer.ista.ac.at/record/6380
DOI: 10.1145/3290366

Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.”10.1109/BLOC.2019.8751326__IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.
LibreCat: https://research-explorer.ista.ac.at/record/6056
DOI: 10.1109/BLOC.2019.8751326
arXiv: 1902.07986

Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.”10.1145/3297280.3297319__Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part 7772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.
LibreCat: https://research-explorer.ista.ac.at/record/6378
DOI: 10.1145/3297280.3297319
WoS: 000474685800049

Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”10.1145/3314221.3314581__PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.
LibreCat: https://research-explorer.ista.ac.at/record/6175
DOI: 10.1145/3314221.3314581
WoS: 000523190300014
arXiv: 1902.04659

Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.”10.1145/3297280.3297322__Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part 7772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.
LibreCat: https://research-explorer.ista.ac.at/record/6490
DOI: 10.1145/3297280.3297322
WoS: 000474685800052

Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.”10.1145/3363525__ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
LibreCat: https://research-explorer.ista.ac.at/record/7158
DOI: 10.1145/3363525
WoS: 000564108400004

Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.”10.1145/3339984__ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.
LibreCat: https://research-explorer.ista.ac.at/record/7014
DOI: 10.1145/3339984
WoS: 000564108400001
arXiv: 1705.00317

Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.”10.29007/5z5k__22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k.
LibreCat: https://research-explorer.ista.ac.at/record/10883
DOI: 10.29007/5z5k
arXiv: 1909.04983

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.
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037

Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.”10.1007/978-3-319-10575-8_27__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.
LibreCat: https://research-explorer.ista.ac.at/record/59
DOI: 10.1007/978-3-319-10575-8_27

Chatterjee, Krishnendu, et al. “Computing Average Response Time.”10.1007/978-3-319-95246-8_9__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.
LibreCat: https://research-explorer.ista.ac.at/record/86
DOI: 10.1007/978-3-319-95246-8_9

Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”10.1038/s41467-017-02721-8__Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.
LibreCat: https://research-explorer.ista.ac.at/record/454
DOI: 10.1038/s41467-017-02721-8
WoS: 000424318200001

Brázdil, Tomás, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. 8033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.
LibreCat: https://research-explorer.ista.ac.at/record/143
DOI: 10.1145/3209108.3209191
WoS: 000545262800020

Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.”10.1038/s41586-018-0277-x__Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x.
LibreCat: https://research-explorer.ista.ac.at/record/157
DOI: 10.1038/s41586-018-0277-x
WoS: 000438240900054

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.
LibreCat: https://research-explorer.ista.ac.at/record/310
DOI: 10.1137/1.9781611975031.151
WoS: 000483921200152
arXiv: 1711.09148

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.
LibreCat: https://research-explorer.ista.ac.at/record/5679
DOI: 10.1007/978-3-030-02768-1_11
WoS: 000916310900011
arXiv: 1806.06683

Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.”10.1038/s41562-018-0320-9__Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.
LibreCat: https://research-explorer.ista.ac.at/record/419
DOI: 10.1038/s41562-018-0320-9
WoS: 000446612000016

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.
LibreCat: https://research-explorer.ista.ac.at/record/79
DOI: 10.1007/978-3-319-99154-2_4
WoS: 000548912200004
arXiv: 1806.05126

Brázdil, Tomás, 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.
LibreCat: https://research-explorer.ista.ac.at/record/297
DOI: 10.1007/978-3-319-89960-2_21
WoS: 000546326300021

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.
LibreCat: https://research-explorer.ista.ac.at/record/141
DOI: 10.1007/978-3-319-96142-2_13
WoS: 000491469700013

Hoffman, Moshe, et al. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.”10.1038/s41562-018-0354-z__Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 397–404, doi:10.1038/s41562-018-0354-z.
LibreCat: https://research-explorer.ista.ac.at/record/293
DOI: 10.1038/s41562-018-0354-z
WoS: 000435551300009

Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.”10.1145/3219166.3219198__Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
LibreCat: https://research-explorer.ista.ac.at/record/5967
DOI: 10.1145/3219166.3219198
WoS: 000492755100020

Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.”10.1145/3174800__ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.
LibreCat: https://research-explorer.ista.ac.at/record/5993
DOI: 10.1145/3174800
WoS: 000434634500003
arXiv: 1510.08517

Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”10.24963/ijcai.2018/662__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.
LibreCat: https://research-explorer.ista.ac.at/record/25
DOI: 10.24963/ijcai.2018/662
WoS: 000764175404127

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.
LibreCat: https://research-explorer.ista.ac.at/record/24
DOI: 10.24963/ijcai.2018/652
WoS: 000764175404117
arXiv: 1804.10601

Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.
LibreCat: https://research-explorer.ista.ac.at/record/34
WoS: 000492986200006
arXiv: 1710.00675

Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling , AAAI Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/35
WoS: 000492986200007
arXiv: 1804.07031

Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”10.1007/s11241-017-9293-4__Real-Time Systems, vol. 54, no. 1, Springer, 2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
LibreCat: https://research-explorer.ista.ac.at/record/738
DOI: 10.1007/s11241-017-9293-4
WoS: 000419955500006

Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.”10.1098/rsif.2018.0073__Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.
LibreCat: https://research-explorer.ista.ac.at/record/198
DOI: 10.1098/rsif.2018.0073
WoS: 000428576200023
PMID: 29593089

Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.”10.1038/s42003-018-0078-7__Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.
LibreCat: https://research-explorer.ista.ac.at/record/5751
DOI: 10.1038/s42003-018-0078-7
WoS: 000461126500071

Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.
LibreCat: https://research-explorer.ista.ac.at/record/66
DOI: 10.4230/LIPIcs.CONCUR.2018.11
arXiv: 1806.03108

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.
LibreCat: https://research-explorer.ista.ac.at/record/311
DOI: 10.1007/978-3-319-89884-1_26

Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.”10.1109/Cybermatics_2018.2018.00231__Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231.
LibreCat: https://research-explorer.ista.ac.at/record/6340
DOI: 10.1109/Cybermatics_2018.2018.00231
WoS: 000481634500196
arXiv: 1805.09104

Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.”10.1145/3210257__ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257.
LibreCat: https://research-explorer.ista.ac.at/record/6009
DOI: 10.1145/3210257
WoS: 000444694800001
arXiv: 1510.07565