Rasmus Kyng
Orcid: 0000-0002-8268-6258
According to our database1,
Rasmus Kyng
authored at least 44 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Commun. ACM, December, 2023
CoRR, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
Almost-Linear-Time Weighted 𝓁<sub>p</sub>-Norm Solvers in Slightly Dense Graphs via Sparsification.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
CoRR, 2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Proceedings of The 28th Conference on Learning Theory, 2015
2014
Proceedings of the Symposium on Theory of Computing, 2014