_id,doi,title
7810,10.1007/978-3-030-44914-8_5,"Optimal and perfectly parallel algorithms for on-demand data-flow analysis"
7158,10.1145/3363525,"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth"
6822,10.1007/978-3-030-30806-3_1,"Bidding games on Markov decision processes"
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"
66,10.4230/LIPIcs.CONCUR.2018.11,"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies."
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"
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"
478,10.3233/978-1-61499-672-9-1432,"The complexity of deciding legality of a single step of magic: The gathering"
1340,10.1007/978-3-662-53354-3_6,"The big match in small space"
1182,,"Robust draws in balanced knockout tournaments"
1071,10.4230/LIPIcs.ESA.2016.28,"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs"
1437,10.1145/2837614.2837624,"Algorithms for algebraic path properties in concurrent systems of constant treewidth components"
5430,10.15479/AT:IST-2015-319-v1-1,"Faster algorithms for quantitative verification in constant treewidth graphs"
1559,10.1073/pnas.1511366112,"Computational complexity of ecological and evolutionary spatial dynamics"
524,10.1016/j.ic.2015.03.009,"Qualitative analysis of concurrent mean payoff games"
5431,10.15479/AT:IST-2015-322-v1-1,"The patience of concurrent stochastic games with safety and reachability objectives"
5432,10.15479/AT:IST-2015-323-v1-1,"The complexity of evolutionary games on graphs"
5437,10.15479/AT:IST-2015-330-v2-1,"Faster algorithms for quantitative verification in constant treewidth graphs"
5440,10.15479/AT:IST-2015-323-v2-2,"The complexity of evolutionary games on graphs"
5438,10.15479/AT:IST-2015-334-v1-1,"Edit distance for pushdown automata"
1602,10.1145/2676726.2676979,"Faster algorithms for algebraic path properties in recursive state machines with constant treewidth"
1607,10.1007/978-3-319-21690-4_9,"Faster algorithms for quantitative verification in constant treewidth graphs"
1610,10.1007/978-3-662-47666-6_10,"Edit distance for pushdown automata"
5441,10.15479/AT:IST-2015-340-v1-1,"Algorithms for algebraic path properties in concurrent systems of constant treewidth components"
2216,10.1145/2562059.2562141,"Edit distance for timed automata"
5420,10.15479/AT:IST-2014-191-v1-1,"The value 1 problem for concurrent mean-payoff games"
5419,10.15479/AT:IST-2014-187-v1-1,"Improved algorithms for reachability and shortest path on low tree-width graphs"
5421,10.15479/AT:IST-2014-190-v2-2,"The complexity of evolution on graphs"
2162,10.1007/978-3-662-43951-7_11,"The complexity of ergodic mean payoff games"
5427,10.15479/AT:IST-2014-314-v1-1,"Optimal tree-decomposition balancing and reachability on low treewidth graphs"
5409,10.15479/AT:IST-2013-144-v1-1,"Edit distance for timed automata"
5404,10.15479/AT:IST-2013-127-v1-1,"The complexity of ergodic games"
5403,10.15479/AT:IST-2013-126-v1-1,"Qualitative analysis of concurrent mean-payoff games"