vix.ing · top · new · best · stats · spec

Kyng, Rasmus

  1. Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
    2022/03/01 by Li Chen, Rasmus Kyng, Chen, Li +9 · 4 voices · 49 citations
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Markov Chains and Monte Carlo Methods #Optimization and Search Problems #cs.DS
  2. Approximate Gaussian Elimination for Laplacians: Fast, Sparse, and Simple
    2016/05/08 by Kyng, Rasmus, Sachdeva, Sushant · 7 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  3. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
    2023/09/28 by Jan van den Brand, Li Chen, Brand, Jan van den +13 · 16 citations
    Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Markov Chains and Monte Carlo Methods #Advanced Graph Theory Research
  4. Robust and Practical Solution of Laplacian Equations by Approximate Elimination
    2023/03/01 by Gao, Yuan, Kyng, Rasmus, Spielman, Daniel A. · 8 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical Software (cs.MS) #Numerical Analysis (math.NA)
  5. Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
    2024/07/15 by Jan van den Brand, Brand, Jan van den, Li Chen +11 · 10 citations
    Computer Science · #Data Management and Algorithms #Advanced Database Systems and Queries #Constraint Satisfaction and Optimization
  6. Algorithms for Lipschitz Learning on Graphs
    2015/05/01 by Kyng, Rasmus, Rao, Anup, Sachdeva, Sushant +1 · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Metric Geometry (math.MG)
  7. Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
    2018/11/26 by Cohen, Michael B., Kelner, Jonathan, Kyng, Rasmus +4 · 3 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  8. Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow
    2023/11/30 by Chen, Li, Kyng, Rasmus, Liu, Yang P. +2 · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  9. Sparsified Cholesky and Multigrid Solvers for Connection Laplacians
    2015/12/07 by Kyng, Rasmus, Lee, Yin Tat, Peng, Richard +2 · 2 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  10. Four Deviations Suffice for Rank 1 Matrices
    2019/01/20 by Rasmus Kyng, Kyle Luh, Kyng, Rasmus +3 · 2 citations
    Mathematics · #Random Matrices and Applications #Mathematical Approximation and Integration #Analytic Number Theory Research
  11. A Framework for Analyzing Resparsification Algorithms
    2016/11/21 by Rasmus Kyng, Jakub Pachocki, Kyng, Rasmus +5 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Stochastic Gradient Optimization Techniques #Advanced Graph Neural Networks
  12. Flows in Almost Linear Time via Adaptive Preconditioning
    2019/06/25 by Kyng, Rasmus, Peng, Richard, Sachdeva, Sushant +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  13. Assessing GPT Performance in a Proof-Based University-Level Course Under Blind Grading
    2025/05/19 by Ding, Ming, Kyng, Rasmus, Solda, Federico +1 · 1 voice
    #Computation and Language (cs.CL) #Computers and Society (cs.CY) #FOS: Computer and information sciences
  14. On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
    2021/03/08 by Nicolas Emmenegger, Rasmus Kyng, Emmenegger, Nicolas +3 · 1 citation
    Computer Science · Engineering · #Stochastic Gradient Optimization Techniques #Sparse and Compressive Sensing Techniques #Complexity and Algorithms in Graphs
  15. Derandomizing Directed Random Walks in Almost-Linear Time
    2022/08/23 by Kyng, Rasmus, Meierhans, Simon, Gutenberg, Maximilian Probst · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  16. Fast Algorithms for ℓp-Regression
    2022/11/08 by Adil, Deeksha, Kyng, Rasmus, Peng, Richard +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  17. A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
    2023/11/10 by Kyng, Rasmus, Meierhans, Simon, Gutenberg, Maximilian Probst · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  18. A Simple Dynamic Spanner via APSP
    2024/08/21 by Kyng, Rasmus, Meierhans, Simon, Zöcklein, Gernot · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  19. A Simple Framework for Finding Balanced Sparse Cuts via APSP
    2022/09/19 by Chen, Li, Kyng, Rasmus, Gutenberg, Maximilian Probst +1 · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  20. Acceleration Meets Inverse Maintenance: Faster ℓ∞-Regression
    2024/09/30 by Adil, Deeksha, Jiang, Shunhua, Kyng, Rasmus · 1 citation
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
  21. Deterministic Almost-Linear-Time Gomory-Hu Trees
    2025/07/27 by Abboud, Amir, Kyng, Rasmus, Li, Jason +5 · 5 citations
    #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  22. Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
    2025/10/10 by Rasmus Kyng, Maximilian Probst Gutenberg, Kyng, Rasmus +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Stochastic Gradient Optimization Techniques