Rasmus Ibsen-Jensen



I am currently a Post doc. at IST Austria and working with Krishnendu Chatterjee. My PhD advisor was Peter Bro Miltersen. My main research interest is algorithmic game theory, in particular strategy complexity of two player, zero-sum games. Besides that I am also working on problems (1) in programming languages, especially to do with improved algorithms for control flow graphs of programs; and (2) related to edit distance for automata; and (3) in evolution in theoretical biology.

Email: ribsen @ ist.ac.at


Preprint: Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen andRasmus Ibsen-Jensen
Online

List of publications (ordered after age ascending - authors are sorted lexicographically, except for the PNAS paper, which is sorted by contribution, as is standard in their respective fields):

Robust Draws in Balanced Knockout Tournaments
Krishnendu Chatterjee, Rasmus Ibsen-Jensen and Josef Tkadlec
IJCAI'16, Online

The Big Match in Small Space
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen and Michal Koucký
SAGT'16 (Best Paper), Online

The Complexity of Deciding Legality of a Single Step of Magic: the Gathering
Krishnendu Chatterjee and Rasmus Ibsen-Jensen
ECAI'16, Online

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs
Chatterjee, Rasmus Ibsen-Jensen and Andreas Pavlogiannis
ESA'16, Online

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen and Andreas Pavlogiannis
POPL'16, Online

The computational complexity of ecological and evolutionary spatial dynamics
Rasmus Ibsen-Jensen, Krishnendu Chatterjee and Martin Nowak
PNAS, Online (appendix)

Qualitative analysis of concurrent mean-payoff games
Krishnendu Chatterjee and Rasmus Ibsen-Jensen
Information and Computation, Online

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
Krishnendu Chatterjee, Rasmus Ibsen-Jensen and Andreas Pavlogiannis
CAV'15, Online

Edit Distance for Pushdown Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen and Jan Otop
ICALP'15, Online

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis and Prateesh Goyal
POPL'15, Online

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
Krishnendu Chatterjee and Rasmus Ibsen-Jensen
SODA'15, Online

Edit distance for timed automata
Krishnendu Chatterjee, Rasmus Ibsen-Jensen and Rupak Majumdar
HSCC'14, Online

The complexity of ergodic mean-payoff games
Krishnendu Chatterjee and Rasmus Ibsen-Jensen
ICALP'14, Online

The complexity of interior point methods for solving discounted turn-based stochastic games
Thomas Dueholm Hansen and Rasmus Ibsen-Jensen
CIE'13, Online

Patience of matrix games
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii and Elias Tsigaridas
Discrete Applied Mathematics, Online

A faster algorithm for solving one-clock priced timed games
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen and Peter Bro Miltersen
CONCUR'13, Online

Solving simple stochastic games with few coin toss positions
Rasmus Ibsen-Jensen and Peter Bro Miltersen
ESA'12, Online

The complexity of solving reachability games using value and strategy iteration
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen and Peter Bro Miltersen
CSR'11 and TCS: Volume 55, Issue 2, Online