DOI,IST REx ID,Research Group,Title of publication
10.46298/theoretics.25.10,21413,KrCh,Learning algorithms for verification of Markov decision processes
10.7155/jgaa.00591,11938,"UlWa,HeEd,KrCh",On compatible matchings
10.1103/physreve.106.034321,12257,KrCh,Social balance on networks: Local minima and best-edge dynamics
10.1007/978-3-030-68211-8_18,9296,"UlWa,HeEd,KrCh",On compatible matchings
10.1007/s10703-021-00373-5,9393,KrCh,Faster algorithms for quantitative verification in bounded treewidth graphs
10.1038/s41467-021-24271-w,9640,KrCh,Fast and strong amplifiers of natural selection
10.15479/at:ista:10293,10293,"GradSch,KrCh",Evolution of cooperation via (in)direct reciprocity under imperfect information
10.1371/journal.pcbi.1007494,7212,KrCh,Limits on amplifiers of natural selection under death-Birth updating
10.1038/s42003-019-0373-y,7210,KrCh,Population structure determines the tradeoff between fixation probability and fixation time
10.1145/3363525,7158,KrCh,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
10.1038/s41586-018-0277-x,157,KrCh,Evolution of cooperation in stochastic games
10.1038/s41467-017-02721-8,454,KrCh,Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness
10.1038/s42003-018-0078-7,5751,KrCh,Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
10.1145/3174800,5993,KrCh,Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
10.1145/3158119,10417,KrCh,Data-centric dynamic partial order reduction
10.1007/s11241-017-9293-4,738,KrCh,Automated competitive analysis of real time scheduling with graph games
10.1038/s41562-018-0320-9,419,KrCh,Partners and rivals in direct reciprocity
10.1609/icaps.v28i1.13875,34,KrCh,Sensor synthesis for POMDPs with reachability objectives
10.1098/rsif.2018.0073,198,KrCh,Language acquisition with communication between learners
10.1073/pnas.1810565115,2,KrCh,"Indirect reciprocity with private, noisy, and incomplete information"