52 citations · 131 across the 29 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
Lattice-based Locality Sensitive Hashing is Optimal
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota +1
Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (STOC `98) to give the first sublinear time algorithm for the c-approximate nearest neighbor (ANN) problem usin…
cs.DS2017
A Friendly Smoothed Analysis of the Simplex Method
Daniel Dadush, Sophie Huiberts
Explaining the excellent practical performance of the simplex method for linear programming has been a major topic of research for over 50 years. One of the most successful framewo…
cs.DS2017★ 1 cited
The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues
Nikhil Bansal, Daniel Dadush, Shashwat Garg +1
An important result in discrepancy due to Banaszczyk states that for any set of vectors in of norm at most and any convex body in …