_id,doi,title
11938,10.7155/jgaa.00591,On compatible matchings
12257,10.1103/physreve.106.034321,Social balance on networks: Local minima and best-edge dynamics
9296,10.1007/978-3-030-68211-8_18,On compatible matchings
9393,10.1007/s10703-021-00373-5,Faster algorithms for quantitative verification in bounded treewidth graphs
9402,10.1038/s41562-021-01114-8,A unified framework of direct and indirect reciprocity
9640,10.1038/s41467-021-24271-w,Fast and strong amplifiers of natural selection
10293,10.15479/at:ista:10293,Evolution of cooperation via (in)direct reciprocity under imperfect information
7212,10.1371/journal.pcbi.1007494,Limits on amplifiers of natural selection under death-Birth updating
6780,10.1145/3360555,Modular verification for almost-sure termination of probabilistic programs
6836,10.1038/s41586-019-1488-5,Social dilemmas among unequals
6887,10.4230/LIPICS.CONCUR.2019.7,Near-linear time algorithms for Streett objectives in graphs and MDPs
7014,10.1145/3339984,Non-polynomial worst-case analysis of recursive programs
7158,10.1145/3363525,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
7210,10.1038/s42003-019-0373-y,Population structure determines the tradeoff between fixation probability and fixation time
6056,10.1109/BLOC.2019.8751326,Probabilistic smart contracts: Secure randomness on the blockchain
6175,10.1145/3314221.3314581,Cost analysis of nondeterministic probabilistic programs
6378,10.1145/3297280.3297319,"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving"
6380,10.1145/3290366,Efficient parameterized algorithms for data packing
25,10.24963/ijcai.2018/662,Goal-HSVI: Heuristic search value iteration for goal-POMDPs
297,10.1007/978-3-319-89960-2_21,Strategy representation by decision trees in reactive synthesis