BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Switzerland
1 × The Netherlands
12 × USA
2 × Greece
3 × Canada
Collaborated with:
R.Ge D.Steurer S.Khot S.Rao U.V.Vazirani S.Kale E.Chlamtac K.L.Chang R.Kannan G.Karakostas M.Sudan A.Moitra A.Wigderson C.Daskalakis M.Alekhnovich I.Tourlakis J.R.Lee A.Naor P.Raghavan D.R.Karger M.Karpinski Y.Rabani F.T.Leighton B.M.Maggs A.Bhaskara T.Ma R.Kannan A.Kolla M.Tulsiani N.K.Vishnoi Y.Halpern D.M.Mimno D.Sontag Y.Wu M.Zhu
Talks about:
approxim (6) problem (5) algorithm (4) scheme (4) provabl (3) learn (3) graph (3) euclidean (2) guarante (2) toward (2)

Person: Sanjeev Arora

DBLP DBLP: Arora:Sanjeev

Contributed to:

ICML c1 20142014
ICML c2 20132013
STOC 20122012
ICALP (1) 20112011
ICALP (1) 20092009
STOC 20092009
STOC 20082008
STOC 20072007
STOC 20062006
STOC 20052005
STOC 20042004
ICALP 20032003
STOC 20022002
STOC 20012001
STOC 19991999
STOC 19981998
STOC 19971997
STOC 19951995
STOC 19941994
STOC 19901990

Wrote 22 papers:

ICML-c1-2014-AroraBGM #bound #learning
Provable Bounds for Learning Some Deep Representations (SA, AB, RG, TM), pp. 584–592.
ICML-c2-2013-AroraGHMMSWZ #algorithm #modelling #topic
A Practical Algorithm for Topic Modeling with Provable Guarantees (SA, RG, YH, DMM, AM, DS, YW, MZ), pp. 280–288.
STOC-2012-AroraGKM #matrix
Computing a nonnegative matrix factorization — provably (SA, RG, RK, AM), pp. 145–162.
ICALP-v1-2011-AroraG #algorithm #fault #learning
New Algorithms for Learning in Presence of Errors (SA, RG), pp. 403–415.
ICALP-v1-2009-AroraSW #case study #graph #towards
Towards a Study of Low-Complexity Graphs (SA, DS, AW), pp. 119–131.
STOC-2009-AroraDS #algorithm #message passing
Message passing algorithms and improved LP decoding (SA, CD, DS), pp. 3–12.
STOC-2008-AroraKKSTV #constraints #game studies #graph
Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.
STOC-2007-AroraK #approach #combinator #source code
A combinatorial, primal-dual approach to semidefinite programs (SA, SK), pp. 227–236.
STOC-2006-AroraC #approximate
New approximation guarantee for chromatic number (SA, EC), pp. 215–224.
STOC-2005-AlekhnovichAT #towards
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy (MA, SA, IT), pp. 294–303.
Euclidean distortion and the sparsest cut (SA, JRL, AN), pp. 553–562.
STOC-2004-AroraRV #clustering #geometry #graph
Expander flows, geometric embeddings and graph partitioning (SA, SR, UVV), pp. 222–231.
ICALP-2003-AroraC #approximate #problem #strict
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.
STOC-2002-AroraK #algebra #semistructured data
Fitting algebraic curves to noisy data (SA, SK), pp. 162–169.
STOC-2001-SanjeevK #learning
Learning mixtures of arbitrary gaussians (SA, RK), pp. 247–257.
STOC-1999-AroraK #approximate #latency #problem
Approximation Schemes for Minimum Latency Problems (SA, GK), pp. 688–693.
STOC-1998-Arora #np-hard #problem
The Approximability of NP-hard Problems (SA), pp. 337–348.
STOC-1998-AroraRR #approximate #problem
Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.
STOC-1997-AroraS #testing
Improved Low-Degree Testing and its Applications (SA, MS), pp. 485–495.
STOC-1995-AroraKK #approximate #np-hard #polynomial #problem
Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.
STOC-1994-AroraRV #polynomial #simulation
Simulating quadratic dynamical systems is PSPACE-complete (SA, YR, UVV), pp. 459–467.
STOC-1990-AroraLM #algorithm #network #online
On-line Algorithms for Path Selection in a Nonblocking Network (SA, FTL, BMM), pp. 149–158.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.