Author of the publication

Fast computation of low rank matrix approximations

, and . Proceedings of the thirty-third annual ACM symposium on Theory of computing, page 611--618. New York, NY, USA, ACM, (2001)
DOI: 10.1145/380752.380858

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On the solution-space geometry of random constraint satisfaction problems., and . STOC, page 130-139. ACM, (2006)Database-friendly random projections.. PODS, ACM, (2001)Random Satisfiability.. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, IOS Press, (2009)Sampling Grid Colorings with Fewer Colors., , , and . LATIN, volume 2976 of Lecture Notes in Computer Science, page 80-89. Springer, (2004)The Chromatic Number of Random Regular Graphs., and . APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, page 219-228. Springer, (2004)Hiding Satisfying Assignments: Two Are Better than One., , and . AAAI, page 131-136. AAAI Press / The MIT Press, (2004)Random Constraint Satisfaction: A More Accurate Picture., , , , , and . CP, volume 1330 of Lecture Notes in Computer Science, page 107-120. Springer, (1997)Random Walks That Find Perfect Objects and the Lovasz Local Lemma., and . FOCS, page 494-503. IEEE Computer Society, (2014)Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion ., and . FSTTCS, volume 18 of LIPIcs, page 16-23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Threshold phenomena in random graph colouring and satisfiability.. University of Toronto, Canada, (1999)