مقالات بحثية تمّ التفويض بإتاحتها للجميع - Rasmus Ibsen-Jensenمزيد من المعلومات
عدد المقالات البحثية المتاحة للجميع في موقع ما: 24
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
التفويضات: Austrian Science Fund, European Commission
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
التفويضات: Austrian Science Fund, European Commission
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
التفويضات: Danish Council for Independent Research, Danish National Research Foundation …
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
التفويضات: Austrian Science Fund, European Commission
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
التفويضات: Austrian Science Fund
The complexity of ergodic mean-payoff games
K Chatterjee, R Ibsen-Jensen
International Colloquium on Automata, Languages, and Programming, 122-133, 2014
التفويضات: Austrian Science Fund
Infinite-duration poorman-bidding games
G Avni, TA Henzinger, R Ibsen-Jensen
Web and Internet Economics: 14th International Conference, WINE 2018, Oxford …, 2018
التفويضات: Austrian Science Fund
Faster algorithms for quantitative verification in constant treewidth graphs
K Chatterjee, R Ibsen-Jensen, A Pavlogiannis
International Conference on Computer Aided Verification, 140-157, 2015
التفويضات: Austrian Science Fund
Qualitative analysis of concurrent mean-payoff games
K Chatterjee, R Ibsen-Jensen
Information and Computation 242, 2-24, 2015
التفويضات: Austrian Science Fund, National Natural Science Foundation of China, Danish …
All-pay bidding games on graphs
G Avni, R Ibsen-Jensen, J Tkadlec
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1798-1805, 2020
التفويضات: Austrian Science Fund
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
التفويضات: Danish Council for Independent Research, Danish National Research Foundation
The complexity of interior point methods for solving discounted turn-based stochastic games
TD Hansen, R Ibsen-Jensen
Conference on Computability in Europe, 252-262, 2013
التفويضات: Danish Council for Independent Research, Danish National Research Foundation …
Edit distance for pushdown automata
K Chatterjee, TA Henzinger, R Ibsen-Jensen, J Otop
Logical Methods in Computer Science 13, 2017
التفويضات: Austrian Science Fund, European Commission
Language acquisition with communication between learners
R Ibsen-Jensen, J Tkadlec, K Chatterjee, MA Nowak
Journal of The Royal Society Interface 15 (140), 20180073, 2018
التفويضات: US Department of Defense, Austrian Science Fund, European Commission
The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K Chatterjee, R Ibsen-Jensen
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
التفويضات: Austrian Science Fund
Bidding games on markov decision processes
G Avni, TA Henzinger, R Ibsen-Jensen, P Novotný
Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019
التفويضات: Austrian Science Fund
The big match in small space
KA Hansen, R Ibsen-Jensen, M Koucký
International Symposium on Algorithmic Game Theory, 64-76, 2016
التفويضات: Austrian Science Fund, Danish Council for Independent Research, Danish …
Faster algorithms for quantitative verification in bounded treewidth graphs
K Chatterjee, R Ibsen-Jensen, A Pavlogiannis
Formal Methods in System Design 57 (3), 401-428, 2021
التفويضات: Austrian Science Fund, European Commission
Edit distance for timed automata
K Chatterjee, R Ibsen-Jensen, R Majumdar
Proceedings of the 17th international conference on Hybrid systems …, 2014
التفويضات: Austrian Science Fund, European Commission
Patience of matrix games
KA Hansen, R Ibsen-Jensen, VV Podolskii, E Tsigaridas
Discrete Applied Mathematics 161 (16-17), 2440-2459, 2013
التفويضات: Danish Council for Independent Research, Danish National Research Foundation …
يتم تحديد معلومات التمويل والنشر من خلال برنامج كمبيوتر تلقائيًا.