Rasmus Ibsen-Jensen

69 papers A* 8A 4B 8C 1Misc 1Journal 38Unranked 9
YearRankTypeTitle / Venue / Authors
2026 B conf
The Complexity of Games with Randomised Control.
FoSSaCS
Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu
2026 J jnl
The Complexity of Games with Randomised Control.
CoRR
Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu
2025 J jnl
Stochastic Games with Limited Public Memory.
CoRR
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
2024 A* conf
Bounded-Memory Strategies in Partial-Information Games.
LICS
Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
2024 J jnl
Bounded-Memory Strategies in Partial-Information Games.
CoRR
Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke
2024 B conf
The Power of Counting Steps in Quantitative Games.
CONCUR
Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
2024 J jnl
The Power of Counting Steps in Quantitative Games.
CoRR
Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove
2023 J jnl
Games on Graphs.
CoRR
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
2023 J jnl
The Big Match with a Clock and a Bit of Memory.
Math. Oper. Res.
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
2022 — conf
Complexity of Spatial Games.
FSTTCS
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
2021 J jnl
Absorbing games with a clock and two bits of memory.
Games Econ. Behav.
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
2021 J jnl
Faster algorithms for quantitative verification in bounded treewidth graphs.
Formal Methods Syst. Des.
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2021 — conf
Quantitative Verification on Product Graphs of Small Treewidth.
FSTTCS
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2020 A* conf
All-Pay Bidding Games on Graphs.
AAAI
Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
2020 A* conf
One-Clock Priced Timed Games are PSPACE-hard.
LICS
John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
2020 J jnl
One-Clock Priced Timed Games are PSPACE-hard.
CoRR
John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
2020 A conf
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.
ESOP
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2020 J jnl
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis.
CoRR
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2020 B conf
Simplified Game of Life: Algorithms and Complexity.
MFCS
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
2019 J jnl
All-Pay Bidding Games on Graphs.
CoRR
Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec
2019 — conf
Bidding Games on Markov Decision Processes.
RP
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný
2019 J jnl
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.
ACM Trans. Program. Lang. Syst.
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2018 J jnl
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
ACM Trans. Program. Lang. Syst.
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis
2018 B conf
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.
CONCUR
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner
2018 J jnl
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.
CoRR
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner
2018 — conf
Infinite-Duration Poorman-Bidding Games.
WINE
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen
2018 J jnl
Infinite-Duration Poorman-Bidding Games.
CoRR
Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen
2018 A* conf
The Big Match with a Clock and a Bit of Memory.
EC
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
2017 J jnl
A short proof of correctness of the quasi-polynomial time algorithm for parity games.
CoRR
Hugo Gimbert, Rasmus Ibsen-Jensen
2017 J jnl
Edit Distance for Pushdown Automata.
Log. Methods Comput. Sci.
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2017 B conf
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.
MFCS
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak
2017 J jnl
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak
2017 B conf
Strategy Complexity of Concurrent Safety Games.
MFCS
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
2016 A* conf
Algorithms for algebraic path properties in concurrent systems of constant treewidth components.
POPL
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2016 A conf
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs.
ESA
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2016 A* conf
Robust Draws in Balanced Knockout Tournaments.
IJCAI
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec
2016 J jnl
Robust Draws in Balanced Knockout Tournaments.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec
2016 B conf
The Big Match in Small Space - (Extended Abstract).
SAGT
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
2016 J jnl
The Big Match in Small Space.
CoRR
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
2016 A conf
The Complexity of Deciding Legality of a Single Step of Magic: The Gathering.
ECAI
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2015 J jnl
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
CoRR
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2015 — conf
Edit Distance for Pushdown Automata.
ICALP (2)
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2015 J jnl
Edit Distance for Pushdown Automata.
CoRR
Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop
2015 A* conf
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.
POPL
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2015 — conf
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
CAV (1)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2015 J jnl
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2015 J jnl
Qualitative analysis of concurrent mean-payoff games.
Inf. Comput.
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2015 J jnl
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives.
CoRR
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
2015 A* conf
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
SODA
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2014 — conf
Edit distance for timed automata.
HSCC
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Rupak Majumdar
2014 J jnl
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2014 J jnl
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits.
CoRR
Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee
2014 J jnl
Qualitative Analysis of Concurrent Mean-payoff Games.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2014 — conf
The Complexity of Ergodic Mean-payoff Games.
ICALP (2)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2014 J jnl
The Complexity of Ergodic Mean-payoff Games.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2014 J jnl
The Complexity of Solving Reachability Games Using Value and Strategy Iteration.
Theory Comput. Syst.
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2014 J jnl
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2013 B conf
A Faster Algorithm for Solving One-Clock Priced Timed Games.
CONCUR
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2013 J jnl
Patience of matrix games.
Discret. Appl. Math.
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
2013 C conf
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games.
CiE
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
2013 J jnl
The complexity of interior point methods for solving discounted turn-based stochastic games
CoRR
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen
2012 J jnl
A Faster Algorithm for Solving One-Clock Priced Timed Games
CoRR
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2012 J jnl
Patience of Matrix Games
CoRR
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
2012 A conf
Solving Simple Stochastic Games with Few Coin Toss Positions.
ESA
Rasmus Ibsen-Jensen, Peter Bro Miltersen
2012 — conf
Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games.
MEMICS
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2012 J jnl
Strategy complexity of finite-horizon Markov decision processes and simple stochastic games
CoRR
Krishnendu Chatterjee, Rasmus Ibsen-Jensen
2011 J jnl
Solving simple stochastic games with few coin toss positions
CoRR
Rasmus Ibsen-Jensen, Peter Bro Miltersen
2011 Misc conf
The Complexity of Solving Reachability Games Using Value and Strategy Iteration.
CSR
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
2010 J jnl
The complexity of solving reachability games using value and strategy iteration
CoRR
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen