97 citations · 255 across the 28 of their papers we have counts for
3 papers · 1 filter
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Sepehr Abbasi-Zadeh, Nikhil Bansal, Guru Guruganesh +3
Semidefinite programming is a powerful tool in the design and analysis of approximation algorithms for combinatorial optimization problems. In particular, the random hyperplane rou…
Towards Instance-Optimal Private Query Release
Jaroslaw Blasiok, Mark Bun, Aleksandar Nikolov +1
We study efficient mechanisms for the query release problem in differential privacy: given a workload of statistical queries, output approximate answers to the queries while sa…
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
Aleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat
We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in dimensions. We study…