activity
20182023
most citedFaster Divergence Maximization for Faster Maximum Flow

24 citations · 58 across the 19 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

math.AG2021

Weil-Poincaré series and topology of collections of valuations on rational double points

A. Campillo, F. Delgado, S. M. Gusein-Zade

Earlier it was described to which extent the Alexander polynomial in several variables of an algebraic link in the Poincaré sphere determines the topology of the link. It was shown…

cs.DS2021

Improved Iteration Complexities for Overconstrained -Norm Regression

Arun Jambulapati, Yang P. Liu, Aaron Sidford

In this paper we obtain improved iteration complexities for solving regression. We provide methods which given any full-rank with…

cs.DS2021

Online Edge Coloring via Tree Recurrences and Correlation Decay

Janardhan Kulkarni, Yang P. Liu, Ashwin Sah +2

We give an online algorithm that with high probability computes a edge coloring on a graph with maximum degree under online…

math.CO2021

Arithmetic Progressions in Sumsets of Sparse Sets

Noga Alon, Ryan Alweiss, Yang P. Liu +2

A set of positive integers is \emph{log-sparse} if there is an absolute constant so that for any positive integer the sequence contains at most…

cs.DS2021

A Gaussian fixed point random walk

Yang P. Liu, Ashwin Sah, Mehtaab Sawhney

In this note, we design a discrete random walk on the real line which takes steps (and one with steps in ) where at least of the signs are i…

cs.DS2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao

Yu Gao, Yang P. Liu, Richard Peng

We give an algorithm for computing exact maximum flows on graphs with edges and integer capacities in the range in $\widetilde{O}(m^{\frac{3}{2} - \frac{1}{328}} \log…