DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.FSTTCS.2022.11,12101,KrCh,Complexity of spatial games
10.4230/LIPIcs.FSTTCS.2021.42,10629,KrCh,Quantitative verification on product graphs of small treewidth
10.1007/s10703-021-00373-5,9393,KrCh,Faster algorithms for quantitative verification in bounded treewidth graphs
10.4230/LIPIcs.MFCS.2020.22,8533,KrCh,Simplified game of life: Algorithms and complexity
10.1609/aaai.v34i02.5546,9197,"ToHe,KrCh",All-pay bidding games on graphs
10.6084/m9.figshare.5973013.v1,9814,KrCh,Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners
10.1007/978-3-030-44914-8_5,7810,KrCh,Optimal and perfectly parallel algorithms for on-demand data-flow analysis
10.1007/978-3-030-30806-3_1,6822,ToHe,Bidding games on Markov decision processes
10.1145/3363525,7158,KrCh,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
10.1098/rsif.2018.0073,198,KrCh,Language acquisition with communication between learners
10.1145/3219166.3219198,5967,KrCh,The Big Match with a clock and a bit of memory
10.1007/978-3-030-04612-5_2,5788,ToHe,Infinite-duration poorman-bidding games
10.4230/LIPIcs.CONCUR.2018.11,66,KrCh,Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
10.1145/3210257,6009,KrCh,Algorithms for algebraic path properties in concurrent systems of constant treewidth components
10.4230/LIPIcs.MFCS.2017.61,551,KrCh,Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
10.4230/LIPIcs.MFCS.2017.55,553,KrCh,Strategy complexity of concurrent safety games
10.23638/LMCS-13(3:23)2017,465,"KrCh,ToHe",Edit distance for pushdown automata
null,1182,KrCh,Robust draws in balanced knockout tournaments
10.1007/978-3-662-53354-3_6,1340,KrCh,The big match in small space
10.3233/978-1-61499-672-9-1432,478,KrCh,The complexity of deciding legality of a single step of magic: The gathering