Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Arora, Sanjeev"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Overcoming intractability in unsupervised learning
Sanjeev Arora
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 1-1
Computing a nonnegative matrix factorization - provably
Sanjeev Arora
,
Rong Ge
,
Ravindran Kannan
,
Ankur Moitra
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 145-162
Local versus global properties of metric spaces
Sanjeev Arora
,
László Lovász
,
Ilan Newman
,
Yuval Rabani
,
Yuri Rabinovich
,
Santosch Vempala
SIAM Journal on Computing
41
(1), 2012, pp. 250-271
New algorithms for learning in presence of errors
Sanjeev Arora
,
Rong Ge
Lecture Notes in Computer Science
6755
, 2011, pp. 403-415
Semidefinite programming and approximation algorithms: A survey
Sanjeev Arora
Lecture Notes in Computer Science
7074
, 2011, pp. 6-9
O(\sqrt{\log n})
approximation to
Sparsest
Cut
in
\tilde{O}(n^2)
time
Sanjeev Arora
,
Elad Hazan
,
Satyen Kale
SIAM Journal on Computing
39
(5), 2010, pp. 1748-1771
Semidefinite programming and approximation algorithms: A survey
Sanjeev Arora
Lecture Notes in Computer Science
6139
, 2010, pp. 25-25
Message-passing algorithms and improved LP decoding
Sanjeev Arora
,
Constantinos Daskalakis
,
David Steurer
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 3-12
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora
,
Satish Rao
,
Umesh Vazirani
Journal of the ACM
56
(2), 2009, pp. 5: 1-37
Towards a study of low-complexity graphs
Sanjeev Arora
,
David Steurer
,
Avi Wigderson
Lecture Notes in Computer Science
5555
, 2009, pp. 119-131
Unique games on expanding constraint graphs are easy
Sanjeev Arora
,
Subhash A. Khot
,
Alexandra Kolla
,
David Steurer
,
Madhur Tulsiani
,
Nisheeth K. Vishnoi
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 21-28
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora
,
Satyen Kale
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 227-236
New approximation guarantee for chromatic number
Sanjeev Arora
,
Eden Chlamtac
,
Moses Charikar
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 215-224
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Mikhail Alekhnovich
,
Sanjeev Arora
,
Iannis Tourlakis
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 294-303
Euclidean distortion and the sparsest cut
Sanjeev Arora
,
James R. Lee
,
Assaf Naor
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 553-562
Approximation schemes for degree-restricted MST and red-blue separation problems
Sanjeev Arora
,
Kevin Chang
Algorithmica
40
(3), 2004, pp. 189-210
Expander flows, geometric embeddings and graph partitioning
Sanjeev Arora
,
Satish Rao
,
Umesh Vazirani
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 222-231
Approximation schemes for degree-restricted MST and red-blue separation problem
Sanjeev Arora
,
Kevin L. Chang
Lecture Notes in Computer Science
2719
, 2003, pp. 176-188
Approximation schemes for minimum latency problems
Sanjeev Arora
,
George Karakostas
SIAM Journal on Computing
32
(5), 2003, pp. 1317-1337
Fitting algebraic curves to noisy data
Sanjeev Arora
,
Subhash Khot
Journal of Computer and System Sciences
67
(2), 2003, pp. 325-340
Improved low-degree testing and its applications
Sanjeev Arora
,
Madhu Sudan
Combinatorica
23
(3), 2003, pp. 365-426
Proving integrality gaps without knowing the linear program
Sanjeev Arora
,
Béla Bollobás
,
László Lovász
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 313-322
Fitting algebraic curves to noisy data
Sanjeev Arora
,
Subhash Khot
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 162-169
Learning mixtures of arbitrary Gaussians
Sanjeev Arora
,
Ravi Kannan
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 247-257
Approximation schemes for geometric
NP
-hard problems: A survey
Sanjeev Arora
Lecture Notes in Computer Science
2245
, 2001, pp. 16-17
Seiten 1
2
3
>