7 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2024★ 7 cited
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
Arpit Agarwal, Sanjeev Khanna, Huan Li +4
We present a parallel algorithm for the -approximate maximum flow problem in capacitated, undirected graphs with vertices and edges, achieving $O(ε^{-3}\text{polylog…
cs.LG2024
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
Arpit Agarwal, Rad Niazadeh, Prathamesh Patil
In digital health and EdTech, recommendation systems face a significant challenge: users often choose impulsively, in ways that conflict with the platform's long-term payoffs. This…