| 2008 |
|---|
| 18 | EE | Jacob Abernethy,
Elad Hazan,
Alexander Rakhlin:
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.
COLT 2008: 263-274 |
| 17 | EE | Elad Hazan,
Satyen Kale:
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs.
COLT 2008: 57-68 |
| 16 | EE | Elad Hazan:
Sparse Approximate Solutions to Semidefinite Programs.
LATIN 2008: 306-316 |
| 2007 |
|---|
| 15 | EE | Elad Hazan,
Nimrod Megiddo:
Online Learning with Prior Knowledge.
COLT 2007: 499-513 |
| 14 | EE | Elad Hazan,
Amit Agarwal,
Satyen Kale:
Logarithmic regret algorithms for online convex optimization.
Machine Learning 69(2-3): 169-192 (2007) |
| 2006 |
|---|
| 13 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
A Fast Random Sampling Algorithm for Sparsifying Matrices.
APPROX-RANDOM 2006: 272-279 |
| 12 | EE | Elad Hazan,
Adam Kalai,
Satyen Kale,
Amit Agarwal:
Logarithmic Regret Algorithms for Online Convex Optimization.
COLT 2006: 499-513 |
| 11 | EE | Amit Agarwal,
Elad Hazan,
Satyen Kale,
Robert E. Schapire:
Algorithms for portfolio management based on the Newton method.
ICML 2006: 9-16 |
| 10 | EE | Elad Hazan:
Approximate Convex Optimization by Online Game Playing
CoRR abs/cs/0610119: (2006) |
| 9 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the complexity of approximating k-set packing.
Computational Complexity 15(1): 20-39 (2006) |
| 2005 |
|---|
| 8 | EE | Sanjeev Arora,
Eli Berger,
Elad Hazan,
Guy Kindler,
Muli Safra:
On Non-Approximability for Quadratic Programs.
FOCS 2005: 206-215 |
| 7 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method.
FOCS 2005: 339-348 |
| 6 | EE | Satyen Kale,
Elad Hazan,
Fengyun Cao,
Jaswinder Pal Singh:
Analysis and Algorithms for Content-Based Event Matching.
ICDCS Workshops 2005: 363-369 |
| 5 | EE | Eran Halperin,
Elad Hazan:
HAPLOFREQ - Estimating Haplotype Frequencies E.ciently.
RECOMB 2005: 553-568 |
| 4 | EE | Sanjeev Arora,
Eli Berger,
Elad Hazan,
Guy Kindler,
Muli Safra:
On Non-Approximability for Quadratic Programs
Electronic Colloquium on Computational Complexity (ECCC)(058): (2005) |
| 2004 |
|---|
| 3 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time.
FOCS 2004: 238-247 |
| 2003 |
|---|
| 2 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the Complexity of Approximating k-Dimensional Matching.
RANDOM-APPROX 2003: 83-97 |
| 1 | EE | Elad Hazan,
Shmuel Safra,
Oded Schwartz:
On the Hardness of Approximating k-Dimensional Matching
Electronic Colloquium on Computational Complexity (ECCC) 10(020): (2003) |
