Solving SDD linear systems in nearly *m*log^{1/2}*n* timeMB 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 | 153 | 2014 |

Solving SDD linear systems in nearly *m*log^{1/2}*n* timeMB 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 | 153 | 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 | 131 | 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 | 102 | 2016 |

Algorithms for Lipschitz learning on graphs R Kyng, A Rao, S Sachdeva, DA Spielman Conference on Learning Theory, 1190-1223, 2015 | 63 | 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 | 54 | 2017 |

Fast, Provable Algorithms for Isotonic Regression in all -norms R Kyng, A Rao, S Sachdeva arXiv preprint arXiv:1507.00710, 2015 | 46 | 2015 |

Iterative Refinement for *ℓ*_{p}-norm RegressionD Adil, R Kyng, R Peng, S Sachdeva Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 34 | 2019 |

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 | 29 | 2017 |

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 | 25 | 2018 |

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 | 18 | 2019 |

Preconditioning in expectation MB Cohen, R Kyng, JW Pachocki, R Peng, A Rao arXiv preprint arXiv:1401.6236, 2014 | 14 | 2014 |

Hardness results for structured linear systems R Kyng, P Zhang SIAM Journal on Computing 49 (4), FOCS17-280-FOCS17-349, 2020 | 13 | 2020 |

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 | 13 | 2018 |

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 |

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 | 6 | 2020 |

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 | 4 | 2020 |

Almost-linear-time Weighted -norm Solvers in Slightly Dense Graphs via Sparsification D Adil, B Bullins, R Kyng, S Sachdeva arXiv preprint arXiv:2102.06977, 2021 | 1 | 2021 |