Rasmus Kyng

Available identifiers

zbMath Open kyng.rasmusMaRDI QIDQ2213766

List of research outcomes

Publication	Date of Publication	Type
Incremental approximate maximum flow on undirected graphs in subpolynomial update time	2024-11-28	Paper
An almost-linear time algorithm for maximum flow and more (invited talk)	2024-11-14	Paper
Incremental SSSP for sparse digraphs beyond the hopset barrier	2024-07-19	Paper
Scalar and matrix Chernoff bounds from \(\ell_\infty\)-independence	2024-07-19	Paper
Hardness results for Laplacians of simplicial complexes via sparse-linear equation complete gadgets	2024-06-24	Paper
Two-commodity flow is equivalent to linear programming under nearly-linear time reductions	2024-06-24	Paper
Maintaining expander decompositions via sparse cuts	2024-05-14	Paper
A simple framework for finding balanced sparse cuts via APSP	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6126260	2024-04-09	Paper
Robust and Practical Solution of Laplacian Equations by Approximate Elimination	2023-03-01	Paper
Four deviations suffice for rank 1 matrices	2020-12-03	Paper
Iterative Refinement for ℓp-norm Regression	2019-10-15	Paper
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees	2018-10-18	Paper
A Framework for Analyzing Resparsification Algorithms	2018-07-16	Paper
Sparsified Cholesky and multigrid solvers for connection laplacians	2017-09-29	Paper
Sampling random spanning trees faster than matrix multiplication	2017-08-17	Paper
Solving SDD linear systems in nearly m log 1/2 n time	2015-06-26	Paper
Algorithms for Lipschitz Learning on Graphs	2015-05-01	Paper

Research outcomes over time

This page was built for person: Rasmus Kyng