PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Arora, Sanjeev"

Author of the publication

copydeleteadd this publication to your clipboard
Expander flows, geometric embeddings and graph partitioning.

, , and . J. ACM, 56 (2): 5:1-5:37 (2009)

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.

No persons found for author name Arora, Sanjeev
add a person with the name Arora, Sanjeev
 

Other publications of authors with the same name

Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems., and . Algorithmica, 40 (3): 189-210 (2004)Improved Low-Degree Testing and its Applications., and . Combinatorica, 23 (3): 365-426 (2003)O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time., , and . SIAM J. Comput., 39 (5): 1748-1771 (2010)"Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders"., , , and . NIPS, page 2384-2392. (2012)A randomized online algorithm for bandwidth utilization., and . SODA, page 535-539. ACM/SIAM, (2002)Improved Algorithms for Unique Games via Divide and Conquer., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy, , and . Electronic Colloquium on Computational Complexity (ECCC), (2004)Provable Bounds for Learning Some Deep Representations., , , and . CoRR, (2013)Exploring complexity through reductions.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Towards a Study of Low-Complexity Graphs., , and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 119-131. Springer, (2009)