( en | de | ru )

 

Disambiguation of "Ibsen-Jensen, Rasmus"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis.

, , , and . ESOP, volume 12075 of Lecture Notes in Computer Science, page 112-140. Springer, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michaela Ibsen

Timo Ibsen

Rasmus Lindstrot

Exploitation of the MERIS oxygen A band channel for the retrieval of cloud top pressure and the correction of instrumental stray light. FU Berlin, (2009)

Rasmus Fischer

Rasmus Thamsen

 

Other publications of authors with the same name

Patience of Matrix Games, , , and . CoRR, (2012)The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games., and . CiE, volume 7921 of Lecture Notes in Computer Science, page 252-262. Springer, (2013)Robust Draws in Balanced Knockout Tournaments., , and . IJCAI, page 172-179. IJCAI/AAAI Press, (2016)Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth., , , , and . ACM Trans. Program. Lang. Syst., 41 (4): 23:1-23:46 (2019)The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games., and . SODA, page 1018-1029. SIAM, (2015)One-Clock Priced Timed Games are PSPACE-hard., , and . LICS, page 397-409. ACM, (2020)Algorithms for algebraic path properties in concurrent systems of constant treewidth components., , , and . POPL, page 733-747. ACM, (2016)Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies., , , and . CONCUR, volume 118 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components., , , and . CoRR, (2015)A short proof of correctness of the quasi-polynomial time algorithm for parity games., and . CoRR, (2017)