Rasmus Ibsen-Jensen

439 total citations
19 papers, 123 citations indexed

About

Rasmus Ibsen-Jensen is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Rasmus Ibsen-Jensen has authored 19 papers receiving a total of 123 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 8 papers in Artificial Intelligence and 7 papers in Computer Networks and Communications. Recurrent topics in Rasmus Ibsen-Jensen's work include Formal Methods in Verification (6 papers), Parallel Computing and Optimization Techniques (5 papers) and Distributed systems and fault tolerance (4 papers). Rasmus Ibsen-Jensen is often cited by papers focused on Formal Methods in Verification (6 papers), Parallel Computing and Optimization Techniques (5 papers) and Distributed systems and fault tolerance (4 papers). Rasmus Ibsen-Jensen collaborates with scholars based in Austria, Denmark and United Kingdom. Rasmus Ibsen-Jensen's co-authors include Krishnendu Chatterjee, Martin A. Nowak, Andreas Pavlogiannis, Amir Kafshdar Goharshady, Kristoffer Arnsfelt Hansen, Abraham Neyman, Peter Bro Miltersen, Yaron Velner, Thomas A. Henzinger and Rupak Majumdar and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Journal of The Royal Society Interface and Mathematics of Operations Research.

In The Last Decade

Rasmus Ibsen-Jensen

19 papers receiving 122 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Rasmus Ibsen-Jensen Austria 6 51 33 31 29 22 19 123
David Richerby United Kingdom 9 137 2.7× 34 1.0× 41 1.3× 25 0.9× 31 1.4× 28 206
Gregory J. Puleo United States 8 69 1.4× 17 0.5× 82 2.6× 22 0.8× 11 0.5× 23 202
Jetty Kleijn Netherlands 9 135 2.6× 7 0.2× 73 2.4× 46 1.6× 7 0.3× 56 264
Anthony Perez France 7 73 1.4× 9 0.3× 15 0.5× 24 0.8× 6 0.3× 18 122
Yuhou Xia United States 5 21 0.4× 10 0.3× 163 5.3× 13 0.4× 9 0.4× 5 202
Diyue Bu United States 7 17 0.3× 16 0.5× 191 6.2× 16 0.6× 43 2.0× 11 249
Jesmin Jahan Tithi United States 8 12 0.2× 9 0.3× 87 2.8× 38 1.3× 22 176
Monroe Newborn Canada 8 44 0.9× 39 1.2× 112 3.6× 25 0.9× 3 0.1× 20 174
Yoav Rodeh Israel 4 97 1.9× 3 0.1× 38 1.2× 32 1.1× 7 0.3× 10 125
Loïc Cerf Brazil 4 10 0.2× 28 0.8× 16 0.5× 31 1.1× 3 0.1× 10 110

Countries citing papers authored by Rasmus Ibsen-Jensen

Since Specialization
Citations

This map shows the geographic impact of Rasmus Ibsen-Jensen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Rasmus Ibsen-Jensen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rasmus Ibsen-Jensen more than expected).

Fields of papers citing papers by Rasmus Ibsen-Jensen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Rasmus Ibsen-Jensen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Rasmus Ibsen-Jensen. The network helps show where Rasmus Ibsen-Jensen may publish in the future.

Co-authorship network of co-authors of Rasmus Ibsen-Jensen

This figure shows the co-authorship network connecting the top 25 collaborators of Rasmus Ibsen-Jensen. A scholar is included among the top collaborators of Rasmus Ibsen-Jensen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Rasmus Ibsen-Jensen. Rasmus Ibsen-Jensen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Ibsen-Jensen, Rasmus, et al.. (2024). Bounded-Memory Strategies in Partial-Information Games. 1–14. 1 indexed citations
2.
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, & Abraham Neyman. (2022). The Big Match with a Clock and a Bit of Memory. Mathematics of Operations Research. 48(1). 419–432. 1 indexed citations
3.
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, & Andreas Pavlogiannis. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 57(3). 401–428. 1 indexed citations
4.
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, & Abraham Neyman. (2021). Absorbing games with a clock and two bits of memory. Games and Economic Behavior. 128. 213–230. 2 indexed citations
5.
Chatterjee, Krishnendu, et al.. (2019). Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Transactions on Programming Languages and Systems. 41(4). 1–46. 8 indexed citations
6.
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, & Martin A. Nowak. (2018). Language acquisition with communication between learners. Journal of The Royal Society Interface. 15(140). 20180073–20180073. 3 indexed citations
7.
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, & Yaron Velner. (2018). Ergodic Mean-Payoff Games for the Analysis of Attacks in\n Crypto-Currencies. arXiv (Cornell University). 5 indexed citations
8.
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, & Abraham Neyman. (2018). The Big Match with a Clock and a Bit of Memory. 149–150. 4 indexed citations
9.
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, & Andreas Pavlogiannis. (2018). Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Transactions on Programming Languages and Systems. 40(3). 1–43. 8 indexed citations
10.
Chatterjee, Krishnendu, et al.. (2017). Edit Distance for Pushdown Automata. Logical Methods in Computer Science. Volume 13, Issue 3(3). 3 indexed citations
11.
Chatterjee, Krishnendu, et al.. (2017). Strategy Complexity of Concurrent Safety Games. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
12.
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, & Andreas Pavlogiannis. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 733–747. 13 indexed citations
13.
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, & Andreas Pavlogiannis. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM SIGPLAN Notices. 51(1). 733–747. 2 indexed citations
14.
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, & Andreas Pavlogiannis. (2016). Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 57. 17. 1 indexed citations
15.
Chatterjee, Krishnendu & Rasmus Ibsen-Jensen. (2015). Qualitative analysis of concurrent mean-payoff games. Information and Computation. 242. 2–24. 3 indexed citations
16.
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, & Martin A. Nowak. (2015). Computational complexity of ecological and evolutionary spatial dynamics. Proceedings of the National Academy of Sciences. 112(51). 15636–15641. 40 indexed citations
17.
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, & Rupak Majumdar. (2014). Edit distance for timed automata. 303–312. 4 indexed citations
18.
Chatterjee, Krishnendu, et al.. (2014). Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. DSpace (IIT Bombay). 97–109. 17 indexed citations
19.
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, & Peter Bro Miltersen. (2013). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems. 55(2). 380–403. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by David Richerby Breakdown of academic impact, for papers by Gregory J. Puleo Breakdown of academic impact, for papers by Jetty Kleijn Breakdown of academic impact, for papers by Anthony Perez Breakdown of academic impact, for papers by Yuhou Xia Breakdown of academic impact, for papers by Diyue Bu Breakdown of academic impact, for papers by Jesmin Jahan Tithi Breakdown of academic impact, for papers by Monroe Newborn Breakdown of academic impact, for papers by Yoav Rodeh Breakdown of academic impact, for papers by Loïc Cerf
Rankless by CCL
2026