![]() | Up a level |
Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus and Neyman, Abraham
(2021)
Absorbing games with a clock and two bits of memory.
Games and Economic Behavior, 128.
pp. 213-230.
Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus ORCID: 0000-0003-4783-0389, Goharshady, Amir Kafshdar and Pavlogiannis, Andreas
(2018)
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
ACM Transactions on Programming Languages and Systems, 40 (3).
pp. 1-43.
Avni, Guy, Ibsen-Jensen, Rasmus and Tkadlec, Josef
(2020)
All-Pay Bidding Games on Graphs.
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 34.
pp. 1798-1805.
Avni, Guy, Henzinger, Thomas A, Ibsen-Jensen, Rasmus and Novotný, Petr
(2019)
Bidding Games on Markov Decision Processes.
.
Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus and Koucky, Michal
(2016)
The Big Match in Small Space (Extended Abstract).
.
Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus and Neyman, Abraham
(2022)
The Big Match with a Clock and a Bit of Memory.
MATHEMATICS OF OPERATIONS RESEARCH.
Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus and Neyman, Abraham
(2018)
The Big Match with a Clock and a Bit of Memory.
In: EC '18: ACM Conference on Economics and Computation.
Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus
(2016)
The Complexity of Deciding Legality of a Single Step of Magic: The Gathering.
.
Ibsen-Jensen, Rasmus, Chatterjee, Krishnendu and Nowak, Martin A
(2015)
Computational complexity of ecological and evolutionary spatial dynamics.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 112 (51).
pp. 15636-15641.
Chatterjee, Krishnendu, Henzinger, Thomas A, Ibsen-Jensen, Rasmus and Otop, Jan
(2015)
Edit Distance for Pushdown Automata.
Automata, Languages, and Programming, 9135 (3).
pp. 121-133.
Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus, Pavlogiannis, Andreas and Goyal, Prateesh
(2015)
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.
ACM SIGPLAN NOTICES, 50 (1).
pp. 97-109.
Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Goyal, Prateesh, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas
(2019)
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.
ACM Transactions on Programming Languages and Systems, 41 (4).
pp. 1-46.
Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas
(2015)
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
.
Chatterjee, Krishnendu, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas
(2021)
Faster algorithms for quantitative verification in bounded treewidth graphs.
Formal Methods in System Design, 57 (3).
pp. 401-428.
Avni, Guy, Henzinger, Thomas A and Ibsen-Jensen, Rasmus
(2018)
Infinite-Duration Poorman-Bidding Games.
WEB AND INTERNET ECONOMICS, WINE 2018, 11316.
pp. 21-36.
Ibsen-Jensen, Rasmus, Tkadlec, Josef, Chatterjee, Krishnendu and Nowak, Martin A
(2018)
Language acquisition with communication between learners.
JOURNAL OF THE ROYAL SOCIETY INTERFACE, 15 (140).
20180073-.
Fearnley, John, Ibsen-Jensen, Rasmus and Savani, Rahul ORCID: 0000-0003-1262-7831
(2020)
One-Clock Priced Timed Games are PSPACE-hard.
LICS '20: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, abs/20.
pp. 397-409.
Fearnley, John, Ibsen-Jensen, Rasmus and Savani, Rahul
(2020)
One-Clock Priced Timed Games are PSPACE-hard.
.
Chatterjee, Krishnendu, Goharshady, Amir Kafshdar, Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas
(2020)
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis.
PROGRAMMING LANGUAGES AND SYSTEMS ( ESOP 2020), 12075.
pp. 112-140.
Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus
(2015)
Qualitative analysis of concurrent mean-payoff games.
Inf. Comput., 242.
pp. 2-24.
Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus
(2015)
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games.
In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.
Gimbert, Hugo and Ibsen-Jensen, Rasmus
(2017)
A short proof of correctness of the quasi-polynomial time algorithm for parity games.
CoRR, abs/17.