default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRasmus Ibsen-Jensen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke
, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. CONCUR 2024: 13:1-13:18- [c29]Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke:
Bounded-Memory Strategies in Partial-Information Games. LICS 2024: 17:1-17:14 - [i27]Sougata Bose, Rasmus Ibsen-Jensen, Patrick Totzke:
Bounded-Memory Strategies in Partial-Information Games. CoRR abs/2405.09406 (2024) - [i26]Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke, Pierre Vandenhove:
The Power of Counting Steps in Quantitative Games. CoRR abs/2406.17482 (2024) - 2023
- [j9]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. Math. Oper. Res. 48(1): 419-432 (2023) - [i25]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:
Games on Graphs. CoRR abs/2305.10546 (2023) - 2022
- [c28]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Complexity of Spatial Games. FSTTCS 2022: 11:1-11:14 - 2021
- [j8]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021) - [j7]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
Absorbing games with a clock and two bits of memory. Games Econ. Behav. 128: 213-230 (2021) - [c27]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS 2021: 42:1-42:23 - 2020
- [c26]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. AAAI 2020: 1798-1805 - [c25]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP 2020: 112-140 - [c24]John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani:
One-Clock Priced Timed Games are PSPACE-hard. LICS 2020: 397-409 - [c23]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Simplified Game of Life: Algorithms and Complexity. MFCS 2020: 22:1-22:13 - [i24]John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani:
One-Clock Priced Timed Games are PSPACE-hard. CoRR abs/2001.04458 (2020) - [i23]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR abs/2001.11070 (2020)
2010 – 2019
- 2019
- [j6]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019) - [c22]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Petr Novotný:
Bidding Games on Markov Decision Processes. RP 2019: 1-12 - [i22]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. CoRR abs/1911.08360 (2019) - 2018
- [j5]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) - [c21]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR 2018: 11:1-11:17 - [c20]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. EC 2018: 149-150 - [c19]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen:
Infinite-Duration Poorman-Bidding Games. WINE 2018: 21-36 - [i21]Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen:
Infinite-Duration Poorman-Bidding Games. CoRR abs/1804.04372 (2018) - [i20]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CoRR abs/1806.03108 (2018) - 2017
- [j4]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. Log. Methods Comput. Sci. 13(3) (2017) - [c18]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Safety Games. MFCS 2017: 55:1-55:13 - [c17]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak:
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. MFCS 2017: 61:1-61:13 - [i19]Hugo Gimbert, Rasmus Ibsen-Jensen:
A short proof of correctness of the quasi-polynomial time algorithm for parity games. CoRR abs/1702.01953 (2017) - [i18]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak:
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. CoRR abs/1706.06931 (2017) - 2016
- [c16]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. ECAI 2016: 1432-1439 - [c15]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. ESA 2016: 28:1-28:17 - [c14]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. IJCAI 2016: 172-179 - [c13]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL 2016: 733-747 - [c12]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký:
The Big Match in Small Space - (Extended Abstract). SAGT 2016: 64-76 - [i17]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. CoRR abs/1604.05090 (2016) - [i16]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký:
The Big Match in Small Space. CoRR abs/1604.07634 (2016) - 2015
- [j3]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Qualitative analysis of concurrent mean-payoff games. Inf. Comput. 242: 2-24 (2015) - [c11]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CAV (1) 2015: 140-157 - [c10]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. ICALP (2) 2015: 121-133 - [c9]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL 2015: 97-109 - [c8]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. SODA 2015: 1018-1029 - [i15]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CoRR abs/1504.07384 (2015) - [i14]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. CoRR abs/1504.08259 (2015) - [i13]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. CoRR abs/1506.02434 (2015) - [i12]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR abs/1510.07565 (2015) - 2014
- [j2]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory Comput. Syst. 55(2): 380-403 (2014) - [c7]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Rupak Majumdar:
Edit distance for timed automata. HSCC 2014: 303-312 - [c6]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Ergodic Mean-payoff Games. ICALP (2) 2014: 122-133 - [i11]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Ergodic Mean-payoff Games. CoRR abs/1404.5734 (2014) - [i10]Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee:
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits. CoRR abs/1405.0833 (2014) - [i9]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Qualitative Analysis of Concurrent Mean-payoff Games. CoRR abs/1409.5306 (2014) - [i8]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. CoRR abs/1409.6690 (2014) - [i7]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR abs/1410.7724 (2014) - 2013
- [j1]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas:
Patience of matrix games. Discret. Appl. Math. 161(16-17): 2440-2459 (2013) - [c5]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen:
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games. CiE 2013: 252-262 - [c4]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
A Faster Algorithm for Solving One-Clock Priced Timed Games. CONCUR 2013: 531-545 - [i6]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen:
The complexity of interior point methods for solving discounted turn-based stochastic games. CoRR abs/1304.1888 (2013) - 2012
- [c3]Rasmus Ibsen-Jensen, Peter Bro Miltersen:
Solving Simple Stochastic Games with Few Coin Toss Positions. ESA 2012: 636-647 - [c2]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. MEMICS 2012: 106-117 - [i5]Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
A Faster Algorithm for Solving One-Clock Priced Timed Games. CoRR abs/1201.3498 (2012) - [i4]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas:
Patience of Matrix Games. CoRR abs/1206.1751 (2012) - [i3]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. CoRR abs/1209.3617 (2012) - 2011
- [c1]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR 2011: 77-90 - [i2]Rasmus Ibsen-Jensen, Peter Bro Miltersen:
Solving simple stochastic games with few coin toss positions. CoRR abs/1112.5255 (2011) - 2010
- [i1]Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen:
The complexity of solving reachability games using value and strategy iteration. CoRR abs/1007.1812 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
