| 2009 |
| 19 | EE | Boaz Barak,
Moritz Hardt,
Satyen Kale:
The uniform hardcore lemma via approximate Bregman projections.
SODA 2009: 1193-1200 |
| 18 | EE | Elad Hazan,
Satyen Kale:
Better algorithms for benign bandits.
SODA 2009: 38-47 |
| 2008 |
| 17 | EE | Elad Hazan,
Satyen Kale:
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs.
COLT 2008: 57-68 |
| 16 | EE | Satyen Kale,
Yuval Peres,
C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expander Reconstruction.
FOCS 2008: 719-728 |
| 15 | EE | Satyen Kale,
C. Seshadhri:
An Expansion Tester for Bounded Degree Graphs.
ICALP (1) 2008: 527-538 |
| 2007 |
| 14 | EE | Elad Hazan,
Satyen Kale:
Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria.
NIPS 2007 |
| 13 | EE | Boaz Barak,
Kamalika Chaudhuri,
Cynthia Dwork,
Satyen Kale,
Frank McSherry,
Kunal Talwar:
Privacy, accuracy, and consistency too: a holistic solution to contingency table release.
PODS 2007: 273-282 |
| 12 | EE | T. S. Jayram,
Satyen Kale,
Erik Vee:
Efficient aggregation algorithms for probabilistic data.
SODA 2007: 346-355 |
| 11 | EE | Sanjeev Arora,
Satyen Kale:
A combinatorial, primal-dual approach to semidefinite programs.
STOC 2007: 227-236 |
| 10 | EE | Satyen Kale,
C. Seshadhri:
Testing Expansion in Bounded Degree Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(076): (2007) |
| 9 | EE | Satyen Kale:
Boosting and hard-core set constructions: a simplified approach.
Electronic Colloquium on Computational Complexity (ECCC) 14(131): (2007) |
| 8 | EE | Abhiram G. Ranade,
Srikanth S. Mahabalarao,
Satyen Kale:
A variation on SVD based image compression.
Image Vision Comput. 25(6): 771-777 (2007) |
| 7 | EE | Elad Hazan,
Amit Agarwal,
Satyen Kale:
Logarithmic regret algorithms for online convex optimization.
Machine Learning 69(2-3): 169-192 (2007) |
| 2006 |
| 6 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
A Fast Random Sampling Algorithm for Sparsifying Matrices.
APPROX-RANDOM 2006: 272-279 |
| 5 | EE | Elad Hazan,
Adam Kalai,
Satyen Kale,
Amit Agarwal:
Logarithmic Regret Algorithms for Online Convex Optimization.
COLT 2006: 499-513 |
| 4 | EE | Amit Agarwal,
Elad Hazan,
Satyen Kale,
Robert E. Schapire:
Algorithms for portfolio management based on the Newton method.
ICML 2006: 9-16 |
| 2005 |
| 3 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method.
FOCS 2005: 339-348 |
| 2 | EE | Satyen Kale,
Elad Hazan,
Fengyun Cao,
Jaswinder Pal Singh:
Analysis and Algorithms for Content-Based Event Matching.
ICDCS Workshops 2005: 363-369 |
| 2004 |
| 1 | EE | Sanjeev Arora,
Elad Hazan,
Satyen Kale:
0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time.
FOCS 2004: 238-247 |