Rasmus Kyng - RankMe

86 papers A* 33A 3B 2Journal 46Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows. SODA Maximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan
2026	J	`jnl`	Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop. CoRR Noah Amsel, Yves Baumann, Paul Beckman, Peter Bürgisser, Chris Camaño, Tyler Chen, Edmond Chow, Anil Damle, Michal Derezinski, Mark Embree, Ethan N. Epperly, Robert D. Falgout, Mark Fornace, Anne Greenbaum, Chen Greif, Diana Halikias, Zhen Huang, Elias Jarlebring, Yiannis Koutis, Daniel Kressner, Rasmus Kyng, Jörg Liesen, Jackie Lok, Raphael A. Meyer, Yuji Nakatsukasa, Kate Pearce, Richard Peng, David Persson, Elizaveta Rebrova, Ryan Schneider, Rikhav Shah, Edgar Solomonik, Nikhil Srivastava, Alex Townsend, Robert J. Webber, Jess Williams
2025	A*	`conf`	A Simple Dynamic Spanner via APSP. ICALP Rasmus Kyng, Simon Meierhans, Gernot Zöcklein
2025	J	`jnl`	A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows. CoRR Maximilian Probst Gutenberg, Rasmus Kyng, Weixuan Yuan, Wuwei Yuan
2025	A*	`conf`	Acceleration Meets Inverse Maintenance: Faster ℓ ICALP Deeksha Adil, Shunhua Jiang, Rasmus Kyng
2025	J	`jnl`	Acceleration for Distributed Transshipment and Parallel Maximum Flow. CoRR Christoph Grunau, Rasmus Kyng, Goran Zuzic
2025	B	`conf`	Almost-Linear Time Algorithms for Partially Dynamic Graphs (Invited Talk). MFCS Rasmus Kyng
2025	J	`jnl`	Assessing GPT Performance in a Proof-Based University-Level Course Under Blind Grading. CoRR Ming Ding, Rasmus Kyng, Federico Soldà, Weixuan Yuan
2025	A	`conf`	Bootstrapping Dynamic APSP via Sparsification. ESA Rasmus Kyng, Simon Meierhans, Gernot Zöcklein
2025	A*	`conf`	Deterministic Almost-Linear-Time Gomory-Hu Trees. FOCS Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025	J	`jnl`	Deterministic Almost-Linear-Time Gomory-Hu Trees. CoRR Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan
2025	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. J. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2025	J	`jnl`	Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings. CoRR Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder
2025	A*	`conf`	Random-Shift Revisited: Tight Approximations for Tree Embeddings and ℓ₁-Oblivious Routings. FOCS Rasmus Kyng, Maximilian Probst Gutenberg, Tim Rieder
2024	A*	`conf`	A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. STOC Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
2024	B	`conf`	A Framework for Parallelizing Approximate Gaussian Elimination. SPAA Yves Baumann, Rasmus Kyng
2024	J	`jnl`	A Simple Dynamic Spanner via APSP. CoRR Rasmus Kyng, Simon Meierhans, Gernot Zöcklein
2024	J	`jnl`	Acceleration Meets Inverse Maintenance: Faster ℓ CoRR Deeksha Adil, Shunhua Jiang, Rasmus Kyng
2024	A*	`conf`	Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. FOCS Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
2024	J	`jnl`	Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva
2024	A*	`conf`	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
2024	J	`jnl`	Bootstrapping Dynamic APSP via Sparsification. CoRR Rasmus Kyng, Simon Meierhans, Gernot Zöcklein
2024	J	`jnl`	Fast Algorithms for J. ACM Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2024	A*	`conf`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2024	A*	`conf`	Optimal Electrical Oblivious Routing on Expanders. ICALP Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva
2024	J	`jnl`	Optimal Electrical Oblivious Routing on Expanders. CoRR Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	A*	`conf`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	J	`jnl`	A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications. CoRR Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
2023	—	`conf`	A Simple Framework for Finding Balanced Sparse Cuts via APSP. SOSA Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	J	`jnl`	Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg
2023	J	`jnl`	Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2023	A*	`conf`	An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). ICALP Rasmus Kyng
2023	J	`jnl`	Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford
2023	A*	`conf`	Maintaining Expander Decompositions via Sparse Cuts. SODA Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu
2023	J	`jnl`	Robust and Practical Solution of Laplacian Equations by Approximate Elimination. CoRR Yuan Gao, Rasmus Kyng, Daniel A. Spielman
2022	J	`jnl`	A Simple Framework for Finding Balanced Sparse Cuts via APSP. CoRR Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	A*	`conf`	Derandomizing Directed Random Walks in Almost-Linear Time. FOCS Rasmus Kyng, Simon Meierhans, Maximilian Probst
2022	J	`jnl`	Derandomizing Directed Random Walks in Almost-Linear Time. CoRR Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
2022	J	`jnl`	Fast Algorithms for 𝓁 CoRR Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2022	A	`conf`	Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. ITCS Sílvia Casacuberta, Rasmus Kyng
2022	A*	`conf`	Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. ICALP Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang
2022	J	`jnl`	Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. CoRR Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang
2022	A*	`conf`	Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. SODA Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
2022	J	`jnl`	Maintaining Expander Decompositions via Sparse Cuts. CoRR Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu
2022	A*	`conf`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	J	`jnl`	Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022	A	`conf`	On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. AISTATS Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan
2022	A*	`conf`	Scalar and Matrix Chernoff Bounds from ℓ SODA Tali Kaufman, Rasmus Kyng, Federico Soldà
2022	A*	`conf`	Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. ICALP Ming Ding, Rasmus Kyng, Peng Zhang
2022	J	`jnl`	Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions. CoRR Ming Ding, Rasmus Kyng, Peng Zhang
2021	A*	`conf`	Almost-Linear-Time Weighted 𝓁 ICALP Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva
2021	J	`jnl`	Almost-linear-time Weighted 𝓁 CoRR Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva
2021	J	`jnl`	Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. CoRR Sílvia Casacuberta, Rasmus Kyng
2021	J	`jnl`	Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. CoRR Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
2021	J	`jnl`	On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. CoRR Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan
2021	J	`jnl`	Scalar and Matrix Chernoff Bounds from 𝓁 CoRR Tali Kaufman, Rasmus Kyng, Federico Soldà
2020	J	`jnl`	Hardness Results for Structured Linear Systems. SIAM J. Comput. Rasmus Kyng, Peng Zhang
2020	A*	`conf`	Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. SODA Rasmus Kyng, Di Wang, Peng Zhang
2019	J	`jnl`	Flows in Almost Linear Time via Adaptive Preconditioning. CoRR Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
2019	A*	`conf`	Flows in almost linear time via adaptive preconditioning. STOC Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang
2019	J	`jnl`	Four Deviations Suffice for Rank 1 Matrices. CoRR Rasmus Kyng, Kyle Luh, Zhao Song
2019	A*	`conf`	Iterative Refinement for ℓp-norm Regression. SODA Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2019	J	`jnl`	Iterative Refinement for 𝓁 CoRR Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva
2018	A*	`conf`	A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. FOCS Rasmus Kyng, Zhao Song
2018	J	`jnl`	A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. CoRR Rasmus Kyng, Zhao Song
2018	J	`jnl`	Incomplete Nested Dissection. CoRR Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
2018	A*	`conf`	Incomplete nested dissection. STOC Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang
2018	A*	`conf`	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
2018	J	`jnl`	Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford
2017	A*	`conf`	A Framework for Analyzing Resparsification Algorithms. SODA Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva
2017	A*	`conf`	Hardness Results for Structured Linear Systems. FOCS Rasmus Kyng, Peng Zhang
2017	J	`jnl`	Hardness Results for Structured Linear Systems. CoRR Rasmus Kyng, Peng Zhang
2017	A*	`conf`	Sampling random spanning trees faster than matrix multiplication. STOC David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva
2016	J	`jnl`	A Framework for Analyzing Resparsification Algorithms. CoRR Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva
2016	A*	`conf`	Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. FOCS Rasmus Kyng, Sushant Sachdeva
2016	J	`jnl`	Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple. CoRR Rasmus Kyng, Sushant Sachdeva
2016	J	`jnl`	Sampling Random Spanning Trees Faster than Matrix Multiplication. CoRR David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva
2016	A*	`conf`	Sparsified Cholesky and multigrid solvers for connection laplacians. STOC Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
2015	A*	`conf`	Algorithms for Lipschitz Learning on Graphs. COLT Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman
2015	J	`jnl`	Algorithms for Lipschitz Learning on Graphs. CoRR Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman
2015	—	`conf`	Fast, Provable Algorithms for Isotonic Regression in all L_p-norms. NIPS Rasmus Kyng, Anup Rao, Sushant Sachdeva
2015	J	`jnl`	Fast, Provable Algorithms for Isotonic Regression in all ℓ CoRR Rasmus Kyng, Anup Rao, Sushant Sachdeva
2015	J	`jnl`	Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. CoRR Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman
2014	J	`jnl`	Preconditioning in Expectation. CoRR Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao
2014	A*	`conf`	Solving SDD linear systems in nearly STOC Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu