1.6k citations · 3.6k across the 48 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Almost Tight Bounds for Differentially Private Densest Subgraph
Michael Dinitz, Satyen Kale, Silvio Lattanzi +1
We study the Densest Subgraph (DSG) problem under the additional constraint of differential privacy. DSG is a fundamental theoretical question which plays a central role in graph a…
cs.DS2022
Private Matrix Approximation and Geometry of Unitary Orbits
Oren Mangoubi, Yikai Wu, Satyen Kale +2
Consider the following optimization problem: Given matrices and , maximize where varies over the unitary group . Th…
cs.DS2010★ 13 cited
Combinatorial Approximation Algorithms for MaxCut using Random Walks
Satyen Kale, C. Seshadhri
We give the first combinatorial approximation algorithm for Maxcut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and…