Computational complexity of ecological and evolutionary spatial dynamics R Ibsen-Jensen, K Chatterjee, MA Nowak Proceedings of the National Academy of Sciences 112 (51), 15636-15641, 2015 | 63 | 2015 |

Generalized risk-aversion in stochastic multi-armed bandits A Zimin, R Ibsen-Jensen, K Chatterjee arXiv preprint arXiv:1405.0833, 2014 | 46 | 2014 |

Ergodic mean-payoff games for the analysis of attacks in crypto-currencies K Chatterjee, AK Goharshady, R Ibsen-Jensen, Y Velner arXiv preprint arXiv:1806.03108, 2018 | 38 | 2018 |

Solving simple stochastic games with few coin toss positions R Ibsen-Jensen, PB Miltersen Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012 | 30 | 2012 |

Faster algorithms for algebraic path properties in recursive state machines with constant treewidth K Chatterjee, R Ibsen-Jensen, A Pavlogiannis, P Goyal Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015 | 29 | 2015 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 26 | 2016 |

The complexity of solving reachability games using value and strategy iteration KA Hansen, R Ibsen-Jensen, PB Miltersen International Computer Science Symposium in Russia, 77-90, 2011 | 26 | 2011 |

A faster algorithm for solving one-clock priced timed games TD Hansen, R Ibsen-Jensen, PB Miltersen International Conference on Concurrency Theory, 531-545, 2013 | 25 | 2013 |

The complexity of ergodic mean-payoff games K Chatterjee, R Ibsen-Jensen International Colloquium on Automata, Languages, and Programming, 122-133, 2014 | 22 | 2014 |

Optimal and perfectly parallel algorithms for on-demand data-flow analysis K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis Programming Languages and Systems: 29th European Symposium on Programming …, 2020 | 18 | 2020 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components K Chatterjee, R Ibsen-Jensen, AK Goharshady, A Pavlogiannis ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (3), 1-43, 2018 | 18 | 2018 |

Faster algorithms for quantitative verification in constant treewidth graphs K Chatterjee, R Ibsen-Jensen, A Pavlogiannis International Conference on Computer Aided Verification, 140-157, 2015 | 17 | 2015 |

Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth K Chatterjee, AK Goharshady, P Goyal, R Ibsen-Jensen, A Pavlogiannis ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-46, 2019 | 15 | 2019 |

Infinite-duration poorman-bidding games G Avni, TA Henzinger, R Ibsen-Jensen Web and Internet Economics: 14th International Conference, WINE 2018, Oxford …, 2018 | 15 | 2018 |

Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs K Chatterjee, R Ibsen-Jensen, A Pavlogiannis Leibniz International Proceedings in Informatics, LIPIcs 57, 733-747, 2016 | 13 | 2016 |

Qualitative analysis of concurrent mean-payoff games K Chatterjee, R Ibsen-Jensen Information and Computation 242, 2-24, 2015 | 12 | 2015 |

All-pay bidding games on graphs G Avni, R Ibsen-Jensen, J Tkadlec Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1798-1805, 2020 | 11 | 2020 |

The complexity of solving reachability games using value and strategy iteration KA Hansen, R Ibsen-Jensen, PB Miltersen Theory of Computing Systems 55 (2), 380-403, 2014 | 11 | 2014 |

Edit distance for pushdown automata K Chatterjee, TA Henzinger, R Ibsen-Jensen, J Otop Logical Methods in Computer Science 13, 2017 | 10 | 2017 |

A short proof of correctness of the quasi-polynomial time algorithm for parity games H Gimbert, R Ibsen-Jensen arXiv preprint arXiv:1702.01953, 2017 | 10 | 2017 |