Solving SDD linear systems in nearly m log1/2 n 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
142 2014 Solving SDD linear systems in nearly m log1/2 n 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
142 2014 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
117 2016 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
92 2016 Algorithms for Lipschitz learning on graphs R Kyng, A Rao, S Sachdeva, DA Spielman
Conference on Learning Theory, 1190-1223, 2015
59 2015 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
53 2017 Fast, Provable Algorithms for Isotonic Regression in all R Kyng, A Rao, S Sachdeva
arXiv preprint arXiv:1507.00710, 2015
44 2015 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
28 2017 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
26 2019 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
20 2018 Preconditioning in expectation MB Cohen, R Kyng, JW Pachocki, R Peng, A Rao
arXiv preprint arXiv:1401.6236, 2014
14 2014 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
13 2019 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
12 2018 Hardness results for structured linear systems R Kyng, P Zhang
SIAM Journal on Computing 49 (4), FOCS17-280-FOCS17-349, 2020
10 2020 Approximate gaussian elimination R Kyng
PhD thesis. Yale University,, page, 2017
8 2017 Johnson-Lindenstrauss dimensionality reduction on the simplex RJ Kyng, JM Phillips, S Venkatasubramanian
20th Fall Workshop on Computational Geometry, 2010
7 2010 Incomplete nested dissection R Kyng, R Peng, R Schwieterman, P Zhang
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
5 2018 Four deviations suffice for rank 1 matrices R Kyng, K Luh, Z Song
Advances in Mathematics 375, 107366, 2020
3 2020 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
1 2020 A tutorial on matrix approximation by row sampling R Kyng
1 2018 
Sushant SachdevaUTorontoEmail verificata su cs.toronto.edu
