| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Elad Hazan Sanjeev Arora , Eli Berger , Guy Kindler , Muli Safra , Elad Hazan: On Non-Approximability for Quadratic Programs. FOCS 2005 : 206-215 Sanjeev Arora , Elad Hazan, Satyen Kale : Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005 : 339-348 Satyen Kale , Elad Hazan, Fengyun Cao , Jaswinder Pal Singh : Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005 : 363-369 Eran Halperin , Elad Hazan: HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB 2005 : 553-568 Sanjeev Arora , Eli Berger , Elad Hazan, Guy Kindler , Muli Safra : On Non-Approximability for Quadratic Programs Electronic Colloquium on Computational Complexity (ECCC) (058): (2005) Sanjeev Arora , Elad Hazan, Satyen Kale : 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n 2 ) Time. FOCS 2004 : 238-247 Elad Hazan, Shmuel Safra , Oded Schwartz : On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX 2003 : 83-97 Elad Hazan, Shmuel Safra , Oded Schwartz : On the Hardness of Approximating k-Dimensional Matching Electronic Colloquium on Computational Complexity (ECCC) 10 (020): (2003) 1 [ 3 ] [ 4 ] [ 7 ] [ 8 ] 2 [ 4 ] [ 8 ] 3 [ 6 ] 4 [ 5 ] 5 [ 3 ] [ 6 ] [ 7 ] 6 [ 4 ] [ 8 ] 7 [ 4 ] [ 8 ] 8 [ 1 ] [ 2 ] 9 [ 1 ] [ 2 ] 10 [ 6 ]  ©2006 Association for Computing Machinery |
