Please note that ISTA 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.

457 Publications


2024 | Journal Article | IST-REx-ID: 14820 | OA
S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” Theoretical Computer Science, vol. 989. Elsevier, 2024.
[Published Version] View | DOI | Download Published Version (ext.)
 

2024 | Conference Paper | IST-REx-ID: 15006 | OA
J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.
[Published Version] View | Files available | DOI | arXiv
 

2024 | Journal Article | IST-REx-ID: 15083 | OA
V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, and M. Kleshnina, “Efficiency and resilience of cooperation in asymmetric social dilemmas,” Proceedings of the National Academy of Sciences, vol. 121, no. 10. Proceedings of the National Academy of Sciences, 2024.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 

2024 | Research Data Reference | IST-REx-ID: 15108 | OA
V. Hübner and M. Kleshnina, “Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas.’” Zenodo, 2024.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Conference Paper | IST-REx-ID: 12676 | OA
K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.
[Published Version] View | DOI | Download Published Version (ext.)
 

2023 | Conference Paper | IST-REx-ID: 13142 | OA
K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “A learner-verifier framework for neural network controllers and certificates of stochastic systems,” in Tools and Algorithms for the Construction and Analysis of Systems , Paris, France, 2023, vol. 13993, pp. 3–25.
[Published Version] View | Files available | DOI
 

2023 | Journal Article | IST-REx-ID: 12787 | OA
J. Svoboda, J. Tkadlec, K. Kaveh, and K. Chatterjee, “Coexistence times in the Moran process with environmental heterogeneity,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 479, no. 2271. The Royal Society, 2023.
[Published Version] View | Files available | DOI | WoS
 

2023 | Journal Article | IST-REx-ID: 12861 | OA
L. Schmid, F. Ekbatani, C. Hilbe, and K. Chatterjee, “Quantitative assessment can stabilize indirect reciprocity under imperfect information,” Nature Communications, vol. 14. Springer Nature, 2023.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2023 | Conference Paper | IST-REx-ID: 14242 | OA
M. Lechner, D. Zikelic, K. Chatterjee, T. A. Henzinger, and D. Rus, “Quantization-aware interval bound propagation for training certifiably robust quantized neural networks,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 12, pp. 14964–14973.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14243 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Bidding graph games with partially-observable budgets,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 5, pp. 5464–5471.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14259 | OA
J. Kretinsky, T. Meggendorfer, M. Prokop, and S. Rieder, “Guessing winning policies in LTL synthesis by semantic learning,” in 35th International Conference on Computer Aided Verification , Paris, France, 2023, vol. 13964, pp. 390–414.
[Published Version] View | Files available | DOI
 

2023 | Conference Paper | IST-REx-ID: 14318 | OA
Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Automated tail bound analysis for probabilistic recurrence relations,” in Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 16–39.
[Published Version] View | Files available | DOI
 

2023 | Conference Paper | IST-REx-ID: 14317 | OA
S. Akshay, K. Chatterjee, T. Meggendorfer, and D. Zikelic, “MDPs as distribution transformers: Affine invariant synthesis for safety objectives,” in International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 86–112.
[Published Version] View | Files available | DOI
 

2023 | Journal Article | IST-REx-ID: 12738 | OA
K. Chatterjee, J. P. Katoen, S. Mohr, M. Weininger, and T. Winkler, “Stochastic games with lexicographic objectives,” Formal Methods in System Design. Springer Nature, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 

2023 | Journal Article | IST-REx-ID: 10770 | OA
T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications, vol. 13. Springer Nature, pp. 231–264, 2023.
[Published Version] View | Files available | DOI | WoS
 

2023 | Conference Paper | IST-REx-ID: 14417 | OA
C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in 48th International Symposium on Mathematical Foundations of Computer Science, Bordeaux, France, 2023, vol. 272.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Journal Article | IST-REx-ID: 12706 | OA
J. C. Mckerral, M. Kleshnina, V. Ejov, L. Bartle, J. G. Mitchell, and J. A. Filar, “Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations,” PLoS One, vol. 18, no. 2. Public Library of Science, p. e0279838, 2023.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2023 | Conference Paper | IST-REx-ID: 14518 | OA
G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14559
M. Ansaripour, K. Chatterjee, T. A. Henzinger, M. Lechner, and D. Zikelic, “Learning provably stabilizing neural controllers for discrete-time stochastic systems,” in 21st International Symposium on Automated Technology for Verification and Analysis, Singapore, Singapore, 2023, vol. 14215, pp. 357–379.
View | DOI
 

2023 | Conference Paper | IST-REx-ID: 13238 | OA
S. Schmid, J. Svoboda, and M. X. Yeo, “Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation,” in SIROCCO 2023: Structural Information and Communication Complexity , Alcala de Henares, Spain, 2023, vol. 13892, pp. 576–594.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 14657 | OA
J. Tkadlec, K. Kaveh, K. Chatterjee, and M. A. Nowak, “Evolutionary dynamics of mutants that modify population structure,” Journal of the Royal Society, Interface, vol. 20, no. 208. The Royal Society, 2023.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 

2023 | Journal Article | IST-REx-ID: 13258 | OA
M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, and M. A. Nowak, “The effect of environmental information on evolution of cooperation in stochastic games,” Nature Communications, vol. 14. Springer Nature, 2023.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2023 | Research Data Reference | IST-REx-ID: 13336 | OA
M. Kleshnina, “kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Conference Paper | IST-REx-ID: 13967 | OA
J. Kretinsky, T. Meggendorfer, and M. Weininger, “Stopping criteria for value iteration on stochastic games with quantitative objectives,” in 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, MA, United States, 2023, vol. 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Journal Article | IST-REx-ID: 12833 | OA
A. Biniaz et al., “Token swapping on trees,” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2. EPI Sciences, 2023.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14736
M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in 27th International Conference on Financial Cryptography and Data Security, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.
View | DOI
 

2023 | Thesis | IST-REx-ID: 14539 | OA
D. Zikelic, “Automated verification and control of infinite state stochastic systems,” Institute of Science and Technology Austria, 2023.
[Published Version] View | Files available | DOI
 

2023 | Journal Article | IST-REx-ID: 14778 | OA
K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14456 | OA
J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under token sliding,” in 24th International Symposium on Fundamentals of Computation Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2023 | Conference Paper | IST-REx-ID: 14830
D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935.
[Preprint] View | Files available | DOI | arXiv
 

2023 | Conference Paper | IST-REx-ID: 13139 | OA
T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Research Data Reference | IST-REx-ID: 14990 | OA
T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2023 | Conference Paper | IST-REx-ID: 15023 | OA
D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12101 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 

2022 | Conference Paper | IST-REx-ID: 12568 | OA
T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 11938 | OA
O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Preprint | IST-REx-ID: 12677 | OA
K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2022 | Journal Article | IST-REx-ID: 10602 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
[Published Version] View | Files available | DOI | WoS
 

2022 | Journal Article | IST-REx-ID: 10731 | OA
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 11459 | OA
D. Zikelic, B.-Y. E. Chang, P. Bolignano, and F. Raimondi, “Differential cost analysis with simultaneous potentials and anti-potentials,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 442–457.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 12257 | OA
K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Journal Article | IST-REx-ID: 12280 | OA
L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” PLOS Computational Biology, vol. 18, no. 6. Public Library of Science, 2022.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2022 | Journal Article | IST-REx-ID: 9311 | OA
K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12170
T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.
View | DOI
 

2022 | Journal Article | IST-REx-ID: 11402 | OA
K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12775 | OA
K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
[Published Version] View | Files available | DOI | arXiv
 

2022 | Conference Paper | IST-REx-ID: 12000 | OA
K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 

2022 | Journal Article | IST-REx-ID: 12511 | OA
M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2022 | Preprint | IST-REx-ID: 14601 | OA
D. Zikelic, M. Lechner, K. Chatterjee, and T. A. Henzinger, “Learning stabilizing policies in stochastic control systems,” arXiv. .
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2022 | Preprint | IST-REx-ID: 14600 | OA
D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” arXiv. .
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10052 | OA
I. R. Jecker, N. Mazzocchi, and P. Wolf, “Decomposing permutation automata,” in 32nd International Conference on Concurrency Theory, Paris, France, 2021, vol. 203.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10054 | OA
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10075 | OA
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10630 | OA
E. Arrighi et al., “On the complexity of intersection non-emptiness for star-free language classes,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI
 

2021 | Conference Paper | IST-REx-ID: 10694 | OA
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10847 | OA
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 9296 | OA
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2021 | Book Chapter | IST-REx-ID: 9403 | OA
L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.
[Published Version] View | Download Published Version (ext.)
 

2021 | Conference Paper | IST-REx-ID: 12767 | OA
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10667 | OA
M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 8793 | OA
M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9381 | OA
M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” PLoS Computational Biology, vol. 17, no. 4. Public Library of Science, 2021.
[Published Version] View | Files available | DOI | WoS
 

2021 | Journal Article | IST-REx-ID: 9640 | OA
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2021 | Conference Paper | IST-REx-ID: 9646 | OA
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9645 | OA
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2021 | Conference Paper | IST-REx-ID: 10002 | OA
K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10004 | OA
K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10055 | OA
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
[Published Version] View | Files available | DOI | WoS
 

2021 | Conference Paper | IST-REx-ID: 9987 | OA
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 10191 | OA
T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
[Published Version] View | Files available | DOI | arXiv
 

2021 | Thesis | IST-REx-ID: 10199 | OA
V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9293 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Journal Article | IST-REx-ID: 9393 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 9644 | OA
K. Chatterjee, E. K. Goharshady, P. Novotný, and D. Zikelic, “Proving non-termination by program reversal,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1033–1048.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Conference Paper | IST-REx-ID: 10414 | OA
K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Thesis | IST-REx-ID: 8934 | OA
A. K. Goharshady, “Parameterized and algebro-geometric advances in static program analysis,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

2021 | Thesis | IST-REx-ID: 10293 | OA
L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 

2021 | Journal Article | IST-REx-ID: 9997 | OA
L. Schmid, P. Shati, C. Hilbe, and K. Chatterjee, “The evolution of indirect reciprocity under action and assessment generosity,” Scientific Reports, vol. 11, no. 1. Springer Nature, 2021.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2021 | Journal Article | IST-REx-ID: 9402 | OA
L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour, vol. 5, no. 10. Springer Nature, pp. 1292–1302, 2021.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2020 | Conference Paper | IST-REx-ID: 7346 | OA
L. Schmid, K. Chatterjee, and S. Schmid, “The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game,” in Proceedings of the 23rd International Conference on Principles of Distributed Systems, Neuchâtel, Switzerland, 2020, vol. 153.
[Preprint] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8600 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Multi-dimensional long-run average problems for vector addition systems with states,” in 31st International Conference on Concurrency Theory, Virtual, 2020, vol. 171.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8533 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Conference Paper | IST-REx-ID: 8534 | OA
I. R. Jecker, O. Kupferman, and N. Mazzocchi, “Unary prime languages,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
[Published Version] View | Files available | DOI
 

2020 | Conference Paper | IST-REx-ID: 7955 | OA
P. Ashok, K. Chatterjee, J. Kretinsky, M. Weininger, and T. Winkler, “Approximating values of generalized-reachability stochastic games,” in Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , Saarbrücken, Germany, 2020, pp. 102–115.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 8767 | OA
K. Kaveh, A. McAvoy, K. Chatterjee, and M. A. Nowak, “The Moran process on 2-chromatic graphs,” PLOS Computational Biology, vol. 16, no. 11. Public Library of Science, 2020.
[Published Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 8789 | OA
M. Kleshnina, S. Streipert, J. Filar, and K. Chatterjee, “Prioritised learning in snowdrift-type games,” Mathematics, vol. 8, no. 11. MDPI, 2020.
[Published Version] View | Files available | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 8788
A. Pavlogiannis, N. Schaumberger, U. Schmid, and K. Chatterjee, “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, pp. 3981–3992, 2020.
View | DOI | WoS
 

2020 | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “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, pp. 1798–1805, 2020.
[Preprint] View | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7343 | OA
B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens,” Ecology Letters, vol. 23, no. 3. Wiley, pp. 565–574, 2020.
[Published Version] View | Files available | DOI | WoS
 

2020 | Research Data Reference | IST-REx-ID: 13060 | OA
B. Milutinovic, M. Stock, A. V. Grasse, E. Naderlinger, C. Hilbe, and S. Cremer, “Social immunity modulates competition between coinfecting pathogens.” Dryad, 2020.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 8193
K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, and A. Royer, “Multiple-environment Markov decision processes: Efficient analysis and applications,” in Proceedings of the 30th International Conference on Automated Planning and Scheduling, Nancy, France, 2020, vol. 30, pp. 48–56.
View | Files available
 

2020 | Conference Paper | IST-REx-ID: 8272 | OA
K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in International Conference on Computer Aided Verification, 2020, vol. 12225, pp. 398–420.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Journal Article | IST-REx-ID: 8671 | OA
A. Shakiba, A. K. Goharshady, M. R. Hooshmandasl, and M. Alambardar Meybodi, “A note on belief structures and s-approximation spaces,” Iranian Journal of Mathematical Sciences and Informatics, vol. 15, no. 2. Iranian Academic Center for Education, Culture and Research, pp. 117–128, 2020.
[Submitted Version] View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 7212 | OA
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Limits on amplifiers of natural selection under death-Birth updating,” PLoS computational biology, vol. 16. Public Library of Science, 2020.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2020 | Thesis | IST-REx-ID: 7196 | OA
J. Tkadlec, “A role of graphs in evolutionary processes,” Institute of Science and Technology Austria, 2020.
[Published Version] View | Files available | DOI
 

2020 | Research Data Reference | IST-REx-ID: 9814 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2020 | Conference Paper | IST-REx-ID: 8324 | OA
P. Wang, H. Fu, K. Chatterjee, Y. Deng, and M. Xu, “Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time,” in Proceedings of the ACM on Programming Languages, 2020, vol. 4, no. POPL.
[Published Version] View | Files available | DOI | arXiv
 

2020 | Journal Article | IST-REx-ID: 15055 | OA
T. Brázdil, K. Chatterjee, P. Novotný, and J. Vahala, “Reinforcement learning of risk-constrained policies in Markov decision processes,” Proceedings of the 34th AAAI Conference on Artificial Intelligence, vol. 34, no. 06. Association for the Advancement of Artificial Intelligence, pp. 9794–9801, 2020.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications