Search the dblp DataBase

Publications of Author

1. 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]
   
2. 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]
   
3. Sanjeev Arora, Elad Hazan, Satyen Kale
   0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n²) Time. [Citation Graph (0, 0)][DBLP]
   FOCS, 2004, pp:238-247 [Conf]
   
4. 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]
   
5. 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]
   
6. 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]
   
7. Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale
   A variation on SVD based image compression. [Citation Graph (0, 0)][DBLP]
   Image Vision Comput., 2007, v:25, n:6, pp:771-777 [Journal]
   
8. Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar
   Privacy, accuracy, and consistency too: a holistic solution to contingency table release. [Citation Graph (0, 0)][DBLP]
   PODS, 2007, pp:273-282 [Conf]
   
9. T. S. Jayram, Satyen Kale, Erik Vee
   Efficient aggregation algorithms for probabilistic data. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:346-355 [Conf]
   
10. Sanjeev Arora, Satyen Kale
    A combinatorial, primal-dual approach to semidefinite programs. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:227-236 [Conf]
    
11. 
    Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. [Citation Graph (, )][DBLP]
    
    
12. 
    Noise Tolerance of Expanders and Sublinear Expander Reconstruction. [Citation Graph (, )][DBLP]
    
    
13. 
    An Expansion Tester for Bounded Degree Graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. [Citation Graph (, )][DBLP]
    
    
15. 
    The uniform hardcore lemma via approximate Bregman projections. [Citation Graph (, )][DBLP]
    
    
16. 
    Better algorithms for benign bandits. [Citation Graph (, )][DBLP]
    
    
17. 
    Combinatorial Approximation Algorithms for MaxCut using Random Walks [Citation Graph (, )][DBLP]
    
    
18. 
    Boosting and hard-core set constructions: a simplified approach. [Citation Graph (, )][DBLP]
    
    
19. 
    Testing Expansion in Bounded Degree Graphs. [Citation Graph (, )][DBLP]