DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-030-72016-2_2,12767,KrCh,On satisficing in quantitative games
10.1145/3410304,15284,KrCh,RevTerm
10.4230/LIPIcs.CONCUR.2021.18,10052,KrCh,Decomposing permutation automata
10.4230/LIPIcs.ICALP.2021.124,10054,KrCh,Faster algorithms for bounded liveness in graphs and game graphs
10.4230/LIPIcs.STACS.2021.44,10055,KrCh,A Ramsey theorem for finite monoids
10.4230/LIPIcs.MFCS.2021.53,10075,KrCh,A bit of nondeterminism makes pushdown automata expressive and succinct
10.1145/3485541,10191,"GradSch,KrCh",The reads-from equivalence for the TSO and PSO memory models
10.15479/at:ista:10199,10199,"GradSch,KrCh",Improved verification techniques for concurrent systems
10.1007/978-3-030-90870-6_33,10414,KrCh,On lexicographic proof rules for probabilistic termination
10.4230/LIPIcs.FSTTCS.2021.42,10629,KrCh,Quantitative verification on product graphs of small treewidth
10.4230/LIPIcs.FSTTCS.2021.34,10630,KrCh,On the complexity of intersection non-emptiness for star-free language classes
10.1137/1.9781611976465.38,10694,"GradSch,KrCh",Infinite-duration all-pay bidding games
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.1371/journal.pcbi.1008523,9381,KrCh,Mistakes can stabilise the dynamics of rock-paper-scissors games
10.1007/s10703-021-00373-5,9393,KrCh,Faster algorithms for quantitative verification in bounded treewidth graphs
null,9403,"GradSch,KrCh",The evolution of strategic ignorance in strategic interaction
10.1038/s41467-021-24271-w,9640,KrCh,Fast and strong amplifiers of natural selection
10.1145/3453483.3454093,9644,KrCh,Proving non-termination by program reversal
10.1145/3453483.3454076,9645,KrCh,Polynomial reachability witnesses via Stellensätze