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.

380 Publications


2021 | Conference Paper | IST-REx-ID: 9987 | OA
Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from Equivalence.” 33rd International Conference on Computer-Aided Verification , vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
View | DOI | Download Published Version (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9997 | OA
Schmid, Laura, et al. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.” Scientific Reports, vol. 11, no. 1, 17443, Springer Nature, 2021, doi:10.1038/s41598-021-96932-1.
View | Files available | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee, Krishnendu, et al. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.” 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.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” 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.
View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10052 | OA
Jecker, Ismael R., et al. “Decomposing Permutation Automata.” 32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.” 48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.
View | Files available | DOI | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 10055 | OA
Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.” 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.
View | Files available | DOI | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 10075 | OA
Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 9402
Schmid, Laura, et al. “A Unified Framework of Direct and Indirect Reciprocity.” Nature Human Behaviour, Springer Nature, 2021, doi:10.1038/s41562-021-01114-8.
View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9393
Chatterjee, Krishnendu, et al. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design, Springer, 2021, doi:10.1007/s10703-021-00373-5.
View | DOI
 

2020 | Conference Paper | IST-REx-ID: 8193
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.
View | Files available
 

2020 | Conference Paper | IST-REx-ID: 8272 | OA
Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” International Conference on Computer Aided Verification, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:10.1007/978-3-030-53291-8_21.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, et al. “Simplified Game of Life: Algorithms and Complexity.” 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.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8534 | OA
Jecker, Ismael R., et al. “Unary Prime Languages.” 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.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8600 | OA
Chatterjee, Krishnendu, et al. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.” 31st International Conference on Concurrency Theory, vol. 171, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.CONCUR.2020.23.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8671 | OA
Shakiba, A., et al. “A Note on Belief Structures and S-Approximation Spaces.” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2, ACECR Tarbiat Modares University, 2020, pp. 117–28, doi:10.29252/ijmsi.15.2.117.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 8767 | OA
Kaveh, Kamran, et al. “The Moran Process on 2-Chromatic Graphs.” PLOS Computational Biology, vol. 16, no. 11, e1008402, Public Library of Science, 2020, doi:10.1371/journal.pcbi.1008402.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 8788
Pavlogiannis, Andreas, et al. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.” 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.
View | DOI
 

2020 | Journal Article | IST-REx-ID: 8789 | OA
Kleshnina, Maria, et al. “Prioritised Learning in Snowdrift-Type Games.” Mathematics, vol. 8, no. 11, 1945, MDPI, 2020, doi:10.3390/math8111945.
View | Files available | DOI
 

2020 | Thesis | IST-REx-ID: 7196 | OA
Tkadlec, Josef. A Role of Graphs in Evolutionary Processes. IST Austria, 2020, doi:10.15479/AT:ISTA:7196.
View | Files available | DOI
 

2020 | Journal Article | IST-REx-ID: 7212 | OA
Tkadlec, Josef, et al. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.” PLoS Computational Biology, vol. 16, e1007494, PLoS, 2020, doi:10.1371/journal.pcbi.1007494.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7343 | OA
Milutinovic, Barbara, et al. “Social Immunity Modulates Competition between Coinfecting Pathogens.” Ecology Letters, vol. 23, no. 3, Wiley, 2020, pp. 565–74, doi:10.1111/ele.13458.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7346 | OA
Schmid, Laura, et al. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.” 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.
View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 7955 | OA
Ashok, Pranav, et al. “Approximating Values of Generalized-Reachability Stochastic Games.” 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.
View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 9197
Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” 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.
View | DOI | arXiv
 

2020 | Research Data Reference | IST-REx-ID: 9814
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.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8728 | OA
Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.
View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 8089 | OA
Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” 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.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2020 | Journal Article | IST-REx-ID: 6918 | OA
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 7183 | OA
Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” 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.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7210 | OA
Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” Communications Biology, vol. 2, 138, Springer Nature, 2019, doi:10.1038/s42003-019-0373-y.
View | Files available | DOI | PubMed | Europe PMC
 

2019 | Conference Paper | IST-REx-ID: 7402 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
View | DOI | Download Preprint (ext.) | arXiv
 

2019 | Preprint | IST-REx-ID: 7950 | OA
Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
View | Files available | Download Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 5948
Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” 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.
View | DOI | Download Preprint (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 | Journal Article | IST-REx-ID: 6836 | OA
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 | Conference Paper | IST-REx-ID: 6885 | OA
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.
View | Files available | 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, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6889 | OA
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.
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 Preprint (ext.) | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6884 | OA
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.
View | Files available | DOI | arXiv
 

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 , vol. 3, 129, ACM, 2019, doi:10.1145/3360555.
View | Files available | DOI | arXiv
 

2019 | Conference Paper | IST-REx-ID: 6175 | OA
Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” 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.
View | Files available | DOI | arXiv
 

2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
View | Files available | DOI
 

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, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 7014 | OA
Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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, 2019, 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, 53, ACM, 2019, doi:10.1145/3290366.
View | Files available | DOI
 

2019 | Conference Paper | IST-REx-ID: 6490 | OA
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 | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications