DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-319-96142-2_13,141,KrCh,Symbolic algorithms for graphs and Markov decision processes with fairness objectives
10.1145/3209108.3209191,143,KrCh,Efficient algorithms for asymptotic bounds on termination time in VASS
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.1007/978-3-030-02768-1_11,5679,KrCh,New approaches for almost-sure termination of probabilistic programs
10.1038/s42003-018-0078-7,5751,KrCh,Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory
10.1007/978-3-319-10575-8_27,59,KrCh,Graph games and reactive synthesis
10.1145/3219166.3219198,5967,KrCh,The Big Match with a clock and a bit of memory
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/978-3-319-99154-2_4,79,"KrCh,ToHe",Parameter-independent strategies for pMDPs via POMDPs
10.1007/978-3-319-95246-8_9,86,"KrCh,ToHe",Computing average response time
10.1007/s11241-017-9293-4,738,KrCh,Automated competitive analysis of real time scheduling with graph games
10.1137/1.9781611975031.151,310,KrCh,"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter"
10.1145/3158122,325,KrCh,Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
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
null,35,KrCh,Algorithms and conditional lower bounds for planning problems
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"