DOI,IST REx ID,Research Group,Title of publication
10.1609/aaai.v40i43.40931,21717,"KrCh,GradSch","Qualitative analysis of ω-regular objectives on robust MDPs"
10.1145/3808296,22102,KrCh,SuperDP: Differential privacy refutation via supermartingales
10.5281/ZENODO.18930113,22134,KrCh,SuperDP: Differential Privacy Refutation via Supermartingales
10.4230/LIPIcs.CONCUR.2026.13,22920,"GradSch,KrCh,ToHe",Generalized bidding games: Where bidding and stochastic games meet
10.1007/978-3-031-90653-4_14,19744,KrCh,Refuting equivalence in probabilistic programs with conditioning
10.1609/aaai.v39i11.33213,19667,KrCh,Quantified linear and polynomial arithmetic satisfiability via template-based skolemization
10.1007/978-3-032-08707-2_19,20648,KrCh,PolyQEnt: A polynomial quantified entailment solver
10.24963/ijcai.2024/741,18160,KrCh,Solving long-run average reward robust MDPs via stochastic games
10.1145/3656462,17283,"KrCh,GradSch",Equivalence and similarity refutation for probabilistic programs
10.1007/978-3-030-90870-6_33,10414,KrCh,On lexicographic proof rules for probabilistic termination