Elad Hazan

2009
25	EE	Elad Hazan, Satyen Kale: Better algorithms for benign bandits. SODA 2009: 38-47
24	EE	Elad Hazan, Robert Krauthgamer: How hard is it to approximate the best Nash equilibrium? SODA 2009: 720-727
2008
23	EE	Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT 2008: 263-274
22	EE	Elad Hazan, Satyen Kale: Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68
21	EE	Elad Hazan: Sparse Approximate Solutions to Semidefinite Programs. LATIN 2008: 306-316
2007
20	EE	Elad Hazan, Nimrod Megiddo: Online Learning with Prior Knowledge. COLT 2007: 499-513
19	EE	Peter L. Bartlett, Elad Hazan, Alexander Rakhlin: Adaptive Online Gradient Descent. NIPS 2007
18	EE	Elad Hazan, Satyen Kale: Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS 2007
17	EE	Elad Hazan, C. Seshadhri: Adaptive Algorithms for Online Decision Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088): (2007)
16	EE	Elad Hazan, Amit Agarwal, Satyen Kale: Logarithmic regret algorithms for online convex optimization. Machine Learning 69(2-3): 169-192 (2007)
2006
15	EE	Sanjeev Arora, Elad Hazan, Satyen Kale: A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM 2006: 272-279
14	EE	Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513
13	EE	Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire: Algorithms for portfolio management based on the Newton method. ICML 2006: 9-16
12	EE	Elad Hazan: Approximate Convex Optimization by Online Game Playing CoRR abs/cs/0610119: (2006)
11	EE	Elad Hazan, Shmuel Safra, Oded Schwartz: On the complexity of approximating k-set packing. Computational Complexity 15(1): 20-39 (2006)
10	EE	Amit Agarwal, Elad Hazan: Efficient Algorithms for Online Game Playing and Universal Portfolio Management. Electronic Colloquium on Computational Complexity (ECCC) 13(033): (2006)
9	EE	Eran Halperin, Elad Hazan: HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. Journal of Computational Biology 13(2): 481-500 (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)

Coauthor Index

1	Jacob Abernethy	[23]
2	Amit Agarwal	[10] [13] [14] [16]
3	Sanjeev Arora	[3] [4] [7] [8] [15]
4	Peter L. Bartlett	[19]
5	Eli Berger	[4] [8]
6	Fengyun Cao	[6]
7	Eran Halperin	[5] [9]
8	Adam Tauman Kalai (Adam Kalai)	[14]
9	Satyen Kale	[3] [6] [7] [13] [14] [15] [16] [18] [22] [25]
10	Guy Kindler	[4] [8]
11	Robert Krauthgamer	[24]
12	Nimrod Megiddo	[20]
13	Alexander Rakhlin	[19] [23]
14	Muli Safra	[4] [8]
15	Shmuel Safra	[1] [2] [11]
16	Robert E. Schapire	[13]
17	Oded Schwartz	[1] [2] [11]
18	C. Seshadhri	[17]
19	Jaswinder Pal Singh	[6]

Colors in the list of coauthors