Rasmus Kyng

827 total citations
17 papers, 217 citations indexed

About

Rasmus Kyng is a scholar working on Computational Theory and Mathematics, Statistics and Probability and Computer Networks and Communications. According to data from OpenAlex, Rasmus Kyng has authored 17 papers receiving a total of 217 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 10 papers in Statistics and Probability and 5 papers in Computer Networks and Communications. Recurrent topics in Rasmus Kyng's work include Complexity and Algorithms in Graphs (12 papers), Markov Chains and Monte Carlo Methods (7 papers) and Optimization and Search Problems (4 papers). Rasmus Kyng is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Markov Chains and Monte Carlo Methods (7 papers) and Optimization and Search Problems (4 papers). Rasmus Kyng collaborates with scholars based in United States, Switzerland and Canada. Rasmus Kyng's co-authors include Sushant Sachdeva, Richard Peng, Anup Rao, Maximilian Probst Gutenberg, Yang P. Liu, Li Chen, Daniel A. Spielman, Michael B. Cohen, Gary L. Miller and Shen Xu and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Rasmus Kyng

16 papers receiving 207 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 Kyng United States 8 122 79 55 39 25 17 217
Nati Linial Israel 11 216 1.8× 169 2.1× 52 0.9× 28 0.7× 7 0.3× 35 353
Ashwin Pananjady United States 8 47 0.4× 99 1.3× 69 1.3× 58 1.5× 13 0.5× 28 256
Aaron Sidford United States 8 90 0.7× 146 1.8× 56 1.0× 30 0.8× 10 0.4× 20 245
Paul F. Christiano United States 5 79 0.6× 116 1.5× 42 0.8× 12 0.3× 19 0.8× 8 210
Abbas Mehrabian Canada 9 68 0.6× 124 1.6× 29 0.5× 18 0.5× 48 1.9× 27 258
Jorma K. Merikoski Finland 10 160 1.3× 40 0.5× 19 0.3× 18 0.5× 28 1.1× 62 321
Ofer Neiman Israel 12 278 2.3× 88 1.1× 151 2.7× 12 0.3× 11 0.4× 44 395
Russell Bradford United Kingdom 11 88 0.7× 40 0.5× 117 2.1× 8 0.2× 16 0.6× 37 287
Hans Raj Tiwary Belgium 8 194 1.6× 56 0.7× 37 0.7× 12 0.3× 6 0.2× 22 315
Tsung‐Hsi Tsai Taiwan 10 54 0.4× 128 1.6× 15 0.3× 62 1.6× 11 0.4× 22 261

Countries citing papers authored by Rasmus Kyng

Since Specialization
Citations

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

Fields of papers citing papers by Rasmus Kyng

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Rasmus Kyng

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

All Works

17 of 17 papers shown
1.
Kyng, Rasmus, et al.. (2025). Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. Journal of the ACM. 72(3). 1–103.
2.
3.
Kyng, Rasmus, et al.. (2024). A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. 1174–1183. 1 indexed citations
4.
Brand, Jan van den, Li Chen, Rasmus Kyng, et al.. (2023). A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. 503–514. 11 indexed citations
5.
Chen, Li, Rasmus Kyng, Yang P. Liu, et al.. (2023). Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Communications of the ACM. 66(12). 85–92. 2 indexed citations
6.
Chen, Li, Rasmus Kyng, Yang P. Liu, et al.. (2022). Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. 612–623. 59 indexed citations
7.
Kyng, Rasmus, et al.. (2022). Derandomizing Directed Random Walks in Almost-Linear Time. 407–418. 3 indexed citations
8.
Bullins, Brian, et al.. (2021). Almost-Linear-Time Weighted 𝓁 p -Norm Solvers in Slightly Dense Graphs via Sparsification.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 198. 15. 2 indexed citations
9.
Kyng, Rasmus, et al.. (2020). Four deviations suffice for rank 1 matrices. Advances in Mathematics. 375. 107366–107366. 2 indexed citations
10.
Kyng, Rasmus, et al.. (2020). Hardness Results for Structured Linear Systems. SIAM Journal on Computing. 49(4). FOCS17–280. 1 indexed citations
11.
12.
Cohen, Michael B., Jonathan A. Kelner, Rasmus Kyng, et al.. (2018). Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. 898–909. 9 indexed citations
13.
Kyng, Rasmus, et al.. (2017). Sampling random spanning trees faster than matrix multiplication. 730–742. 17 indexed citations
14.
Kyng, Rasmus, Yin Tat Lee, Richard Peng, Sushant Sachdeva, & Daniel A. Spielman. (2016). Sparsified Cholesky and multigrid solvers for connection laplacians. 842–850. 34 indexed citations
15.
Kyng, Rasmus, Anup Rao, Sushant Sachdeva, & Daniel A. Spielman. (2015). Algorithms for Lipschitz Learning on Graphs. Conference on Learning Theory. 1190–1223. 7 indexed citations
16.
Kyng, Rasmus, Anup Rao, & Sushant Sachdeva. (2015). Fast, provable algorithms for Isotonic regression in all ℓ- p -norms. 28. 2719–2727. 9 indexed citations
17.
Cohen, Michael B., Rasmus Kyng, Gary L. Miller, et al.. (2014). Solving SDD linear systems in nearly m log 1/2 n time. 343–352. 50 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 Nati Linial Breakdown of academic impact, for papers by Ashwin Pananjady Breakdown of academic impact, for papers by Aaron Sidford Breakdown of academic impact, for papers by Paul F. Christiano Breakdown of academic impact, for papers by Abbas Mehrabian Breakdown of academic impact, for papers by Jorma K. Merikoski Breakdown of academic impact, for papers by Ofer Neiman Breakdown of academic impact, for papers by Russell Bradford Breakdown of academic impact, for papers by Hans Raj Tiwary Breakdown of academic impact, for papers by Tsung‐Hsi Tsai
Rankless by CCL
2026