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.
489 Publications
2022 | Published | Journal Article | IST-REx-ID: 12257 |

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

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.
[Published Version]
View
| Files available
| DOI
| arXiv
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.
2021 | Published | Conference Paper | IST-REx-ID: 10629 |

Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 | Book Chapter | IST-REx-ID: 9403 |

The evolution of strategic ignorance in strategic interaction
L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.
[Published Version]
View
| Download Published Version (ext.)
L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.
2021 | Published | Conference Paper | IST-REx-ID: 12767 |

On satisficing in quantitative games
S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.
2021 | Research Data Reference | IST-REx-ID: 15284 |

RevTerm
K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, (2021).
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, (2021).
2021 | Published | Conference Paper | IST-REx-ID: 10004 |

Stochastic processes with expected stopping time
Chatterjee, Krishnendu, Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. 2021
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Chatterjee, Krishnendu, Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. 2021
2021 | Published | Conference Paper | IST-REx-ID: 10847 |

Solving partially observable stochastic shortest-path games
Tomášek, Petr, Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. 2021
[Published Version]
View
| DOI
| Download Published Version (ext.)
Tomášek, Petr, Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. 2021
2021 | Published | Conference Paper | IST-REx-ID: 10002 |

Symbolic time and space tradeoffs for probabilistic verification
Chatterjee, Krishnendu, Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. 2021
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
Chatterjee, Krishnendu, Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. 2021
2021 | Published | Conference Paper | IST-REx-ID: 10414 |

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

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

Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
2021 | Published | Conference Paper | IST-REx-ID: 10667 |

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

Mistakes can stabilise the dynamics of rock-paper-scissors games
Kleshnina, Maria, Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology 17 (4). 2021
[Published Version]
View
| Files available
| DOI
| WoS
Kleshnina, Maria, Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology 17 (4). 2021
2021 | Published | Conference Paper | IST-REx-ID: 9646 |

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

Polynomial reachability witnesses via Stellensätze
Asadi, Ali, Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 2021
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
Asadi, Ali, Polynomial reachability witnesses via Stellensätze. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 2021
2021 | Published | Conference Paper | IST-REx-ID: 9296 |

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.
2021 | Published | Journal Article | IST-REx-ID: 8793 |

Optimal strategies for selecting coordinators
M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.
[Published Version]
View
| Files available
| DOI
| WoS
M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.
2021 | Published | Journal Article | IST-REx-ID: 10191 |

The reads-from equivalence for the TSO and PSO memory models
T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version]
View
| Files available
| DOI
| arXiv
T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).
2021 | Published | Conference Paper | IST-REx-ID: 9987 |

Stateless model checking under a reads-value-from equivalence
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd International Conference on Computer-Aided Verification , Springer Nature, 2021, pp. 341–366.