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
329 2022 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
234 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
222 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
158 2016 Algorithms for Lipschitz learning on graphs R Kyng, A Rao, S Sachdeva, DA Spielman
Conference on Learning Theory, 1190-1223, 2015
100 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
88 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
77 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
59 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
57 2018 A deterministic almost-linear time algorithm for minimum-cost flow J Van Den Brand, L Chen, R Kyng, YP Liu, R Peng, MP Gutenberg, ...
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
48 2023 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 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
31 2018 Hardness results for structured linear systems R Kyng, P Zhang
SIAM Journal on Computing 49 (4), FOCS17-280-FOCS17-349, 2020
21 2020 Four deviations suffice for rank 1 matrices R Kyng, K Luh, Z Song
Advances in Mathematics 375, 107366, 2020
19 2020 Preconditioning in expectation MB Cohen, R Kyng, JW Pachocki, R Peng, A Rao
arXiv preprint arXiv:1401.6236, 2014
19 2014 Approximate gaussian elimination R Kyng
PhD thesis. Yale University,, page, 2017
18 2017 Almost-linear time algorithms for incremental graphs: Cycle detection, sccs, st shortest path, and minimum-cost flow L Chen, R Kyng, YP Liu, S Meierhans, M Probst Gutenberg
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1165-1173, 2024
17 2024 Almost-linear-time Weighted D Adil, B Bullins, R Kyng, S Sachdeva
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
17 2021 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
15 2023 
Sushant SachdevaUToronto, Associate Professor. Vector Institute AffiliateZweryfikowany adres z cs.toronto.edu
