Maximum Flow and Minimum-Cost Flow in Almost-Linear Time S Chen, Li and Kyng, Rasmus and Liu, Yang P. and Peng, Richard and Gutenberg ... 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 | 284 | 2022 |

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 | 224 | 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 | 205 | 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 | 154 | 2016 |

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

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

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 | 58 | 2015 |

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 | 54 | 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 | 45 | 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 | 38 | 2017 |

A deterministic almost-linear time algorithm for minimum-cost flow J Van Den Brand, L Chen, R Peng, R Kyng, YP Liu, MP Gutenberg, ... 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 33 | 2023 |

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

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

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

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

Four deviations suffice for rank 1 matrices R Kyng, K Luh, Z Song Advances in Mathematics 375, 107366, 2020 | 18 | 2020 |

Approximate gaussian elimination R Kyng PhD thesis. Yale University,, page, 2017 | 16 | 2017 |

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

Maintaining expander decompositions via sparse cuts Y Hua, R Kyng, MP Gutenberg, Z Wu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |