default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRasmus Kyng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Optimal Electrical Oblivious Routing on Expanders. ICALP 2024: 65:1-65:19- [c31]Jan van den Brand
, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - [c30]Yves Baumann, Rasmus Kyng:
A Framework for Parallelizing Approximate Gaussian Elimination. SPAA 2024: 195-206 - [c29]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. STOC 2024: 1165-1173 - [c28]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications. STOC 2024: 1174-1183 - [i36]Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Optimal Electrical Oblivious Routing on Expanders. CoRR abs/2406.07252 (2024) - [i35]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR abs/2407.10830 (2024) - [i34]Rasmus Kyng, Simon Meierhans, Gernot Zöcklein:
A Simple Dynamic Spanner via APSP. CoRR abs/2408.11368 (2024) - [i33]Rasmus Kyng, Simon Meierhans, Gernot Zöcklein:
Bootstrapping Dynamic APSP via Sparsification. CoRR abs/2408.11375 (2024) - [i32]Deeksha Adil, Shunhua Jiang, Rasmus Kyng:
Acceleration Meets Inverse Maintenance: Faster ℓ∞-Regression. CoRR abs/2409.20030 (2024) - 2023
- [j2]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow. Commun. ACM 66(12): 85-92 (2023) - [c27]Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - [c26]Rasmus Kyng:
An Almost-Linear Time Algorithm for Maximum Flow and More (Invited Talk). ICALP 2023: 2:1-2:1 - [c25]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. SODA 2023: 48-69 - [c24]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. SOSA 2023: 42-55 - [i31]Yuan Gao, Rasmus Kyng, Daniel A. Spielman:
Robust and Practical Solution of Laplacian Equations by Approximate Elimination. CoRR abs/2303.00709 (2023) - [i30]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR abs/2309.16629 (2023) - [i29]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR abs/2311.03174 (2023) - [i28]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications. CoRR abs/2311.06402 (2023) - [i27]Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg:
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. CoRR abs/2311.18295 (2023) - 2022
- [c23]Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan:
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. AISTATS 2022: 10718-10752 - [c22]Rasmus Kyng, Simon Meierhans, Maximilian Probst:
Derandomizing Directed Random Walks in Almost-Linear Time. FOCS 2022: 407-418 - [c21]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. FOCS 2022: 612-623 - [c20]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. ICALP 2022: 53:1-53:19 - [c19]Ming Ding, Rasmus Kyng, Peng Zhang:
Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. ICALP 2022: 54:1-54:19 - [c18]Sílvia Casacuberta, Rasmus Kyng:
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. ITCS 2022: 33:1-33:24 - [c17]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. SODA 2022: 3452-3481 - [c16]Tali Kaufman, Rasmus Kyng, Federico Soldà:
Scalar and Matrix Chernoff Bounds from ℓ∞-Independence. SODA 2022: 3732-3753 - [i26]Ming Ding, Rasmus Kyng, Peng Zhang:
Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions. CoRR abs/2201.11587 (2022) - [i25]Ming Ding, Rasmus Kyng, Maximilian Probst Gutenberg, Peng Zhang:
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets. CoRR abs/2202.05011 (2022) - [i24]Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva:
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. CoRR abs/2203.00671 (2022) - [i23]Yiding Hua, Rasmus Kyng, Maximilian Probst Gutenberg, Zihang Wu:
Maintaining Expander Decompositions via Sparse Cuts. CoRR abs/2204.02519 (2022) - [i22]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Derandomizing Directed Random Walks in Almost-Linear Time. CoRR abs/2208.10959 (2022) - [i21]Li Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva:
A Simple Framework for Finding Balanced Sparse Cuts via APSP. CoRR abs/2209.08845 (2022) - [i20]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Fast Algorithms for 𝓁p-Regression. CoRR abs/2211.03963 (2022) - 2021
- [c15]Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva:
Almost-Linear-Time Weighted 𝓁p-Norm Solvers in Slightly Dense Graphs via Sparsification. ICALP 2021: 9:1-9:15 - [i19]Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva:
Almost-linear-time Weighted 𝓁p-norm Solvers in Slightly Dense Graphs via Sparsification. CoRR abs/2102.06977 (2021) - [i18]Nicolas Emmenegger, Rasmus Kyng, Ahad N. Zehmakan:
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization. CoRR abs/2103.05138 (2021) - [i17]Sílvia Casacuberta, Rasmus Kyng:
Faster Sparse Matrix Inversion and Rank Computation in Finite Fields. CoRR abs/2106.09830 (2021) - [i16]Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg:
Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. CoRR abs/2110.11712 (2021) - [i15]Tali Kaufman, Rasmus Kyng, Federico Soldà:
Scalar and Matrix Chernoff Bounds from 𝓁∞-Independence. CoRR abs/2111.02177 (2021) - 2020
- [j1]Rasmus Kyng, Peng Zhang:
Hardness Results for Structured Linear Systems. SIAM J. Comput. 49(4) (2020) - [c14]Rasmus Kyng, Di Wang, Peng Zhang:
Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard. SODA 2020: 279-296
2010 – 2019
- 2019
- [c13]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Iterative Refinement for ℓp-norm Regression. SODA 2019: 1405-1424 - [c12]Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang:
Flows in almost linear time via adaptive preconditioning. STOC 2019: 902-913 - [i14]Rasmus Kyng, Kyle Luh, Zhao Song:
Four Deviations Suffice for Rank 1 Matrices. CoRR abs/1901.06731 (2019) - [i13]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Iterative Refinement for 𝓁p-norm Regression. CoRR abs/1901.06764 (2019) - [i12]Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang:
Flows in Almost Linear Time via Adaptive Preconditioning. CoRR abs/1906.10340 (2019) - 2018
- [c11]Rasmus Kyng, Zhao Song:
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. FOCS 2018: 373-384 - [c10]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. FOCS 2018: 898-909 - [c9]Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang:
Incomplete nested dissection. STOC 2018: 404-417 - [i11]Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang:
Incomplete Nested Dissection. CoRR abs/1805.09442 (2018) - [i10]Rasmus Kyng, Zhao Song:
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees. CoRR abs/1810.08345 (2018) - [i9]Michael B. Cohen, Jonathan A. Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford:
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations. CoRR abs/1811.10722 (2018) - 2017
- [c8]Rasmus Kyng, Peng Zhang:
Hardness Results for Structured Linear Systems. FOCS 2017: 684-695 - [c7]Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva:
A Framework for Analyzing Resparsification Algorithms. SODA 2017: 2032-2043 - [c6]David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva:
Sampling random spanning trees faster than matrix multiplication. STOC 2017: 730-742 - [i8]Rasmus Kyng, Peng Zhang:
Hardness Results for Structured Linear Systems. CoRR abs/1705.02944 (2017) - 2016
- [c5]Rasmus Kyng, Sushant Sachdeva:
Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple. FOCS 2016: 573-582 - [c4]Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman:
Sparsified Cholesky and multigrid solvers for connection laplacians. STOC 2016: 842-850 - [i7]Rasmus Kyng, Sushant Sachdeva:
Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple. CoRR abs/1605.02353 (2016) - [i6]Rasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva:
A Framework for Analyzing Resparsification Algorithms. CoRR abs/1611.06940 (2016) - [i5]David Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva:
Sampling Random Spanning Trees Faster than Matrix Multiplication. CoRR abs/1611.07451 (2016) - 2015
- [c3]Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman:
Algorithms for Lipschitz Learning on Graphs. COLT 2015: 1190-1223 - [c2]Rasmus Kyng, Anup Rao, Sushant Sachdeva:
Fast, Provable Algorithms for Isotonic Regression in all L_p-norms. NIPS 2015: 2719-2727 - [i4]Rasmus Kyng, Anup Rao, Sushant Sachdeva, Daniel A. Spielman:
Algorithms for Lipschitz Learning on Graphs. CoRR abs/1505.00290 (2015) - [i3]Rasmus Kyng, Anup Rao, Sushant Sachdeva:
Fast, Provable Algorithms for Isotonic Regression in all ℓp-norms. CoRR abs/1507.00710 (2015) - [i2]Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, Daniel A. Spielman:
Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. CoRR abs/1512.01892 (2015) - 2014
- [c1]Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, Shen Chen Xu:
Solving SDD linear systems in nearly mlog1/2n time. STOC 2014: 343-352 - [i1]Michael B. Cohen, Rasmus Kyng, Jakub W. Pachocki, Richard Peng, Anup B. Rao:
Preconditioning in Expectation. CoRR abs/1401.6236 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
