AroraSanjeev

发表

Probabilistic checking of proofs

AroraSanjeev, SafraShmuel, 1998 .

Learning topic models -- provably and efficiently

AroraSanjeev, GeRong, HalpernYoni, 2018 .

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

AroraSanjeev, 1998 .

Geometry, flows, and graph-partitioning algorithms

AroraSanjeev, VaziraniUmesh, RaoSatish, 2008 .

Expander flows, geometric embeddings and graph partitioning

AroraSanjeev, VaziraniUmesh, RaoSatish, 2009 .

A Combinatorial, Primal-Dual Approach to Semidefinite Programs

AroraSanjeev, KaleSatyen, 2016 .

Computational complexity and information asymmetry in financial products

AroraSanjeev, GeRong, BarakBoaz, 2011 .

Subexponential Algorithms for Unique Games and Related Problems

AroraSanjeev, BarakBoaz, SteurerDavid, 2015 .

Proof verification and the hardness of approximation problems

SudanMadhu, MotwaniRajeev, AroraSanjeev, 1998 .