Skip to content
Log in
Sponsored AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI

Author

Rasmus Kyng

h-index 16 View on Semantic Scholar

We have 3 of 51 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

An Online Sparsification Algorithm from the Book

The original online leverage-score sampling algorithm is indeed robust to adaptive adversaries and is given the first online sparsification algorithm for adaptive streams that yields a sparsifier of near-optimal size $O(d \varepsilon^{-2}\log^2 d)$ whose working memory is proportional to the size of the sparsifier.

Gramoz Goranci, Rasmus Kyng, Maximilian Probst Gutenberg et al. · 1 citation
Conference 2026

Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow

This work presents the first polylog-depth, nearly-linear-work parallel algorithm that achieves a (1 + ε )- bicriteria approximation guarantee for undirected minimum-cost flow on expanders and suggests a promising route toward e O ( m/ε ) work and e O (1 /ε ) depth algorithms for approximate undirected minimum-cost flo...

Rasmus Kyng, Aurelio L. Sulser · 0 citations
Preprint Aug 2026

Partially-Dynamic All-Pairs Maxflow and Effective Resistance via Stable Sparsifiers

A randomized data structure for undirected weighted graphs that are partially dynamic, i.e., that undergo either only edge insertions or only edge deletions is given, which follows from a simple stability principle for partially dynamic graphs.

Gramoz Goranci, Rasmus Kyng, Maximilian Probst Gutenberg et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.