DOI,IST REx ID,Research Group,Title of publication
10.1103/physreve.106.034321,12257,KrCh,Social balance on networks: Local minima and best-edge dynamics
10.1287/moor.2020.1116,9311,"GradSch,KrCh",Finite-memory strategies in POMDPs with long-run average objectives
10.1016/j.jcss.2022.04.003,11402,KrCh,Graph planning with expected finite horizon
10.7155/jgaa.00591,11938,"UlWa,HeEd,KrCh",On compatible matchings
10.1016/j.dam.2020.10.022,8793,KrCh,Optimal strategies for selecting coordinators
10.1007/978-3-030-68211-8_18,9296,"UlWa,HeEd,KrCh",On compatible matchings
10.1109/LICS52264.2021.9470739,10002,KrCh,Symbolic time and space tradeoffs for probabilistic verification
10.1145/3371093,8324,KrCh,Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
10.1109/TCAD.2020.3012803,8788,KrCh,Precedence-aware automated competitive analysis of real-time scheduling
10.1371/journal.pcbi.1007494,7212,KrCh,Limits on amplifiers of natural selection under death-Birth updating
10.1016/j.nahs.2020.100856,7426,ToHe,Abstraction based verification of stability of polyhedral switched systems
null,8193,KrCh,Multiple-environment Markov decision processes: Efficient analysis and applications
10.1609/aaai.v34i06.6531,15055,KrCh,Reinforcement learning of risk-constrained policies in Markov decision processes
10.1007/978-3-030-30281-8_7,6942,"KrCh,ChLa",Strategy representation by decision trees with linear classifiers
10.1145/3363525,7158,KrCh,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
10.1007/978-3-030-29662-9_8,7231,ToHe,Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty
10.1145/3314221.3314581,6175,KrCh,Cost analysis of nondeterministic probabilistic programs
10.1145/3360555,6780,KrCh,Modular verification for almost-sure termination of probabilistic programs
10.4230/LIPICS.CONCUR.2019.27,6885,"ToHe,KrCh",Long-run average behavior of vector addition systems with states
10.4230/LIPICS.CONCUR.2019.7,6887,KrCh,Near-linear time algorithms for Streett objectives in graphs and MDPs