Markus Jalsenius

491 total citations
12 papers, 165 citations indexed

About

Markus Jalsenius is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Markus Jalsenius has authored 12 papers receiving a total of 165 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 3 papers in Molecular Biology. Recurrent topics in Markus Jalsenius's work include Algorithms and Data Compression (6 papers), Complexity and Algorithms in Graphs (4 papers) and Machine Learning and Algorithms (4 papers). Markus Jalsenius is often cited by papers focused on Algorithms and Data Compression (6 papers), Complexity and Algorithms in Graphs (4 papers) and Machine Learning and Algorithms (4 papers). Markus Jalsenius collaborates with scholars based in United Kingdom, Israel and Canada. Markus Jalsenius's co-authors include Benjamin Sach, Raphaël Clifford, Leslie Ann Goldberg, David Richerby, Martin Dyer, Andreǐ A. Bulatov, Andreĭ A. Bulatov, Mark Jerrum, Ashley Montanaro and Ely Porat and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Markus Jalsenius

11 papers receiving 154 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Markus Jalsenius United Kingdom 6 77 57 38 27 19 12 165
Thomas Dueholm Hansen Denmark 7 108 1.4× 94 1.6× 12 0.3× 40 1.5× 8 0.4× 21 187
Anand Louis United States 7 66 0.9× 97 1.7× 9 0.2× 24 0.9× 37 1.9× 15 197
Alistair Stewart United States 6 29 0.4× 109 1.9× 42 1.1× 21 0.8× 12 0.6× 21 178
Marvin Künnemann Germany 6 51 0.7× 84 1.5× 8 0.2× 32 1.2× 13 0.7× 19 142
Dorit Dor Israel 6 128 1.7× 95 1.7× 14 0.4× 45 1.7× 20 1.1× 10 250
Daniil Ryabko France 8 44 0.6× 86 1.5× 19 0.5× 11 0.4× 31 1.6× 31 137
Claus-Peter Schnorr Germany 5 120 1.6× 135 2.4× 14 0.4× 18 0.7× 17 0.9× 17 201
Jesse Kamp United States 7 53 0.7× 94 1.6× 5 0.1× 118 4.4× 26 1.4× 10 205
Yushi Uno Japan 8 188 2.4× 38 0.7× 5 0.1× 70 2.6× 28 1.5× 39 246
Gudmund Skovbjerg Frandsen Denmark 9 118 1.5× 124 2.2× 7 0.2× 25 0.9× 7 0.4× 38 187

Countries citing papers authored by Markus Jalsenius

Since Specialization
Citations

This map shows the geographic impact of Markus Jalsenius'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 Markus Jalsenius with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Jalsenius more than expected).

Fields of papers citing papers by Markus Jalsenius

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Markus Jalsenius. 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 Markus Jalsenius. The network helps show where Markus Jalsenius may publish in the future.

Co-authorship network of co-authors of Markus Jalsenius

This figure shows the co-authorship network connecting the top 25 collaborators of Markus Jalsenius. A scholar is included among the top collaborators of Markus Jalsenius 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 Markus Jalsenius. Markus Jalsenius is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

12 of 12 papers shown
1.
Clifford, Raphaël, Markus Jalsenius, & Benjamin Sach. (2015). ACM-SIAM Symposium on Discrete Algorithms. Symposium on Discrete Algorithms. 84 indexed citations
2.
Clifford, Raphaël, Markus Jalsenius, & Benjamin Sach. (2015). Cell-probe bounds for online edit distance and other pattern matching problems. arXiv (Cornell University). 552–561. 3 indexed citations
3.
Clifford, Peter, Raphaël Clifford, Markus Jalsenius, et al.. (2013). Pattern Matching under Polynomial Transformation. SIAM Journal on Computing. 42(2). 611–633. 3 indexed citations
4.
Jalsenius, Markus, et al.. (2013). Parameterized Matching in the Streaming Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
5.
Dyer, Martin, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2012). The complexity of approximating bounded-degree Boolean #CSP. Information and Computation. 220-221. 1–14. 5 indexed citations
6.
Clifford, Raphaël, Markus Jalsenius, Ely Porat, & Benjamin Sach. (2012). Space lower bounds for online pattern matching. Theoretical Computer Science. 483. 68–74. 3 indexed citations
7.
Bulatov, Andreĭ A., Martin Dyer, Leslie Ann Goldberg, et al.. (2011). The complexity of weighted and unweighted #CSP. Journal of Computer and System Sciences. 78(2). 681–688. 22 indexed citations
8.
Clifford, Raphaël, Markus Jalsenius, Ashley Montanaro, & Benjamin Sach. (2011). The Complexity of Flood Filling Games. Theory of Computing Systems. 50(1). 72–92. 8 indexed citations
9.
Dyer, Martin, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2010). The Complexity of Approximating Bounded-Degree Boolean #CSP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5. 334. 6 indexed citations
10.
Bulatov, Andreǐ A., Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, & David Richerby. (2009). The complexity of weighted Boolean #CSP with mixed signs. Theoretical Computer Science. 410(38-40). 3949–3961. 20 indexed citations
11.
Jalsenius, Markus & Kasper S. Pedersen. (2008). A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID. International Journal of Foundations of Computer Science. 19(6). 1461–1477.
12.
Goldberg, Leslie Ann, Markus Jalsenius, Russell Martin, & Mike Paterson. (2006). Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2. LMS Journal of Computation and Mathematics. 9. 1–20. 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 Thomas Dueholm Hansen Breakdown of academic impact, for papers by Anand Louis Breakdown of academic impact, for papers by Alistair Stewart Breakdown of academic impact, for papers by Marvin Künnemann Breakdown of academic impact, for papers by Dorit Dor Breakdown of academic impact, for papers by Daniil Ryabko Breakdown of academic impact, for papers by Claus-Peter Schnorr Breakdown of academic impact, for papers by Jesse Kamp Breakdown of academic impact, for papers by Yushi Uno Breakdown of academic impact, for papers by Gudmund Skovbjerg Frandsen
Rankless by CCL
2026