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