Rasmus Ibsen-Jensen

From MaRDI portal
Revision as of 17:54, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1702914

Available identifiers

zbMath Open ibsen-jensen.rasmusWikidataQ102413835 ScholiaQ102413835MaRDI QIDQ1702914

List of research outcomes

PublicationDate of PublicationType
The Big Match with a Clock and a Bit of Memory2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q61870592024-02-05Paper
https://portal.mardi4nfdi.de/entity/Q50891842022-07-18Paper
Faster algorithms for quantitative verification in bounded treewidth graphs2021-12-08Paper
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies2021-08-04Paper
Absorbing games with a clock and two bits of memory2021-06-08Paper
One-Clock Priced Timed Games are PSPACE-hard2021-01-21Paper
Infinite-duration poorman-bidding games2020-06-18Paper
https://portal.mardi4nfdi.de/entity/Q51112702020-05-26Paper
https://portal.mardi4nfdi.de/entity/Q51112772020-05-26Paper
Bidding games on Markov decision processes2019-10-22Paper
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs2018-03-02Paper
Faster algorithms for quantitative verification in constant treewidth graphs2018-03-01Paper
https://portal.mardi4nfdi.de/entity/Q53670622017-10-12Paper
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games2017-10-05Paper
Edit distance for timed automata2017-05-16Paper
Algorithms for algebraic path properties in concurrent systems of constant treewidth components2016-10-24Paper
The Big Match in Small Space2016-09-29Paper
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth2016-09-29Paper
Edit Distance for Pushdown Automata2015-11-04Paper
Qualitative analysis of concurrent mean-payoff games2015-06-01Paper
The complexity of solving reachability games using value and strategy iteration2015-02-05Paper
The Complexity of Ergodic Mean-payoff Games2014-07-01Paper
Patience of matrix games2014-04-10Paper
A Faster Algorithm for Solving One-Clock Priced Timed Games2013-08-12Paper
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games2013-08-05Paper
Solving Simple Stochastic Games with Few Coin Toss Positions2012-09-25Paper
The complexity of solving reachability games using value and strategy iteration2011-06-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rasmus Ibsen-Jensen