Follow
Rasmus Kyng
Rasmus Kyng
ETH Zurich
Verified email at kyng.dk - Homepage
Title
Cited by
Cited by
Year
Solving SDD linear systems in nearly mlog1/2n time
MB Cohen, R Kyng, GL Miller, JW Pachocki, R Peng, AB Rao, SC Xu
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1722014
Solving SDD linear systems in nearly mlog1/2n time
MB Cohen, R Kyng, GL Miller, JW Pachocki, R Peng, AB Rao, SC Xu
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1722014
Approximate gaussian elimination for laplacians-fast, sparse, and simple
R Kyng, S Sachdeva
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
1522016
Sparsified cholesky and multigrid solvers for connection laplacians
R Kyng, YT Lee, R Peng, S Sachdeva, DA Spielman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1122016
Algorithms for Lipschitz learning on graphs
R Kyng, A Rao, S Sachdeva, DA Spielman
Conference on Learning Theory, 1190-1223, 2015
702015
Sampling random spanning trees faster than matrix multiplication
D Durfee, R Kyng, J Peebles, AB Rao, S Sachdeva
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
632017
Fast, provable algorithms for isotonic regression in all l_p-norms
R Kyng, A Rao, S Sachdeva
Advances in neural information processing systems 28, 2015
502015
Iterative Refinement for p-norm Regression
D Adil, R Kyng, R Peng, S Sachdeva
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
452019
A framework for analyzing resparsification algorithms
R Kyng, J Pachocki, R Peng, S Sachdeva
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
342017
Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations
MB Cohen, J Kelner, R Kyng, J Peebles, R Peng, AB Rao, A Sidford
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
302018
Flows in almost linear time via adaptive preconditioning
R Kyng, R Peng, S Sachdeva, D Wang
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
272019
A matrix chernoff bound for strongly rayleigh distributions and spectral sparsifiers from a few random spanning trees
R Kyng, Z Song
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
182018
Hardness results for structured linear systems
R Kyng, P Zhang
SIAM Journal on Computing 49 (4), FOCS17-280-FOCS17-349, 2020
162020
Preconditioning in expectation
MB Cohen, R Kyng, JW Pachocki, R Peng, A Rao
arXiv preprint arXiv:1401.6236, 2014
162014
Maximum flow and minimum-cost flow in almost-linear time
L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, S Sachdeva
arXiv preprint arXiv:2203.00671, 2022
122022
Approximate gaussian elimination
R Kyng
PhD thesis. Yale University,, page, 2017
102017
Packing LPs are hard to solve accurately, assuming linear equations are hard
R Kyng, D Wang, P Zhang
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
92020
Almost-linear-time Weighted -norm Solvers in Slightly Dense Graphs via Sparsification
D Adil, B Bullins, R Kyng, S Sachdeva
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
82021
Four deviations suffice for rank 1 matrices
R Kyng, K Luh, Z Song
Advances in Mathematics 375, 107366, 2020
82020
Fast, Provable Algorithms for Isotonic Regression in all -norms
R Kyng, A Rao, S Sachdeva
arXiv preprint arXiv:1507.00710, 2015
82015
The system can't perform the operation now. Try again later.
Articles 1–20