The SCEAS System
| |||||||

## Search the dblp DataBase
Elad Hazan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sanjeev Arora, Elad Hazan, Satyen Kale
**A Fast Random Sampling Algorithm for Sparsifying Matrices.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:272-279 [Conf] - Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
**Logarithmic Regret Algorithms for Online Convex Optimization.**[Citation Graph (0, 0)][DBLP] COLT, 2006, pp:499-513 [Conf] - Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
**On Non-Approximability for Quadratic Programs.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:206-215 [Conf] - Sanjeev Arora, Elad Hazan, Satyen Kale
**0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n**[Citation Graph (0, 0)][DBLP]^{2}) Time. FOCS, 2004, pp:238-247 [Conf] - Sanjeev Arora, Elad Hazan, Satyen Kale
**Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:339-348 [Conf] - Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh
**Analysis and Algorithms for Content-Based Event Matching.**[Citation Graph (0, 0)][DBLP] ICDCS Workshops, 2005, pp:363-369 [Conf] - Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire
**Algorithms for portfolio management based on the Newton method.**[Citation Graph (0, 0)][DBLP] ICML, 2006, pp:9-16 [Conf] - Elad Hazan, Shmuel Safra, Oded Schwartz
**On the Complexity of Approximating k-Dimensional Matching.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:83-97 [Conf] - Eran Halperin, Elad Hazan
**HAPLOFREQ - Estimating Haplotype Frequencies E.ciently.**[Citation Graph (0, 0)][DBLP] RECOMB, 2005, pp:553-568 [Conf] - Elad Hazan, Shmuel Safra, Oded Schwartz
**On the complexity of approximating**[Citation Graph (0, 0)][DBLP]*k*-set packing. Computational Complexity, 2006, v:15, n:1, pp:20-39 [Journal] - Elad Hazan, Shmuel Safra, Oded Schwartz
**On the Hardness of Approximating k-Dimensional Matching**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:020, pp:- [Journal] - Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
**On Non-Approximability for Quadratic Programs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:058, pp:- [Journal] - Elad Hazan, Nimrod Megiddo
**Online Learning with Prior Knowledge.**[Citation Graph (0, 0)][DBLP] COLT, 2007, pp:499-513 [Conf] - Elad Hazan
**Approximate Convex Optimization by Online Game Playing**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs.**[Citation Graph (, )][DBLP]**Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.**[Citation Graph (, )][DBLP]**Efficient learning algorithms for changing environments.**[Citation Graph (, )][DBLP]**Sparse Approximate Solutions to Semidefinite Programs.**[Citation Graph (, )][DBLP]**Adaptive Online Gradient Descent.**[Citation Graph (, )][DBLP]**Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria.**[Citation Graph (, )][DBLP]**How hard is it to approximate the best Nash equilibrium?**[Citation Graph (, )][DBLP]**Better algorithms for benign bandits.**[Citation Graph (, )][DBLP]**Adaptive Algorithms for Online Decision Problems.**[Citation Graph (, )][DBLP]**Efficient Algorithms for Online Game Playing and Universal Portfolio Management.**[Citation Graph (, )][DBLP]
Search in 0.030secs, Finished in 0.031secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |