Preventing false discovery in interactive data analysis is hardMoritz HardtJonathan Ullman2014FOCS 2014Conference paper
Understanding alternating minimization for matrix completionMoritz Hardt2014FOCS 2014Conference paper
Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colorsSubhash KhotRishi Saket2014FOCS 2014Conference paper