Rasmus Ibsen-Jensen
Rasmus Ibsen-Jensen
Zweryfikowany adres z liverpool.ac.uk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Computational complexity of ecological and evolutionary spatial dynamics
R Ibsen-Jensen, K Chatterjee, MA Nowak
Proceedings of the National Academy of Sciences 112 (51), 15636-15641, 2015
502015
The complexity of solving reachability games using value and strategy iteration
KA Hansen, R Ibsen-Jensen, PB Miltersen
International Computer Science Symposium in Russia, 77-90, 2011
262011
Generalized risk-aversion in stochastic multi-armed bandits
A Zimin, R Ibsen-Jensen, K Chatterjee
arXiv preprint arXiv:1405.0833, 2014
242014
Solving simple stochastic games with few coin toss positions
R Ibsen-Jensen, PB Miltersen
European Symposium on Algorithms, 636-647, 2012
242012
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
K Chatterjee, R Ibsen-Jensen, A Pavlogiannis, P Goyal
Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015
232015
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016
212016
Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
K Chatterjee, AK Goharshady, R Ibsen-Jensen, Y Velner
arXiv preprint arXiv:1806.03108, 2018
192018
A faster algorithm for solving one-clock priced timed games
TD Hansen, R Ibsen-Jensen, PB Miltersen
International Conference on Concurrency Theory, 531-545, 2013
192013
Faster algorithms for quantitative verification in bounded treewidth graphs
K Chatterjee, R Ibsen-Jensen, A Pavlogiannis
Formal Methods in System Design, 1-28, 2021
122021
The complexity of ergodic mean-payoff games
K Chatterjee, R Ibsen-Jensen
International Colloquium on Automata, Languages, and Programming, 122-133, 2014
122014
Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs
K Chatterjee, R Ibsen-Jensen, A Pavlogiannis
Leibniz International Proceedings in Informatics, LIPIcs 57, 2016
112016
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K Chatterjee, R Ibsen-Jensen, AK Goharshady, A Pavlogiannis
ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (3), 1-43, 2018
102018
Infinite-duration poorman-bidding games
G Avni, TA Henzinger, R Ibsen-Jensen
International Conference on Web and Internet Economics, 21-36, 2018
92018
The complexity of solving reachability games using value and strategy iteration
KA Hansen, R Ibsen-Jensen, PB Miltersen
Theory of Computing Systems 55 (2), 380-403, 2014
92014
Strategy complexity of two-player, zero-sum games
R Ibsen-Jensen
Department Office Computer Science, Aarhus University, 2013
92013
The complexity of deciding legality of a single step of Magic: The Gathering
K Chatterjee, R Ibsen-Jensen
ECAI 2016, 1432-1439, 2016
82016
Qualitative analysis of concurrent mean-payoff games
K Chatterjee, R Ibsen-Jensen
Information and Computation 242, 2-24, 2015
82015
Optimal and perfectly parallel algorithms for on-demand data-flow analysis
K Chatterjee, AK Goharshady, R Ibsen-Jensen, A Pavlogiannis
European Symposium on Programming 12075, 2020
72020
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
K Chatterjee, AK Goharshady, P Goyal, R Ibsen-Jensen, A Pavlogiannis
ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-46, 2019
72019
Strategy complexity of concurrent safety games
K Chatterjee, KA Hansen, R Ibsen-Jensen
Leibniz International Proceedings in Informatics, LIPIcs 83, 2017
72017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20