Searching for authors named "Satyen Kale" – sorted by Relevance.
-
Noise Tolerance of Expanders and Sublinear Expander Reconstruction
- Noise Tolerance of Expanders and Sublinear Expander Reconstruction Satyen Kale Yuval Peres
- Add To MetaCart
-
Efficient Algorithms Using The Multiplicative Weights Update Method
- Efficient Algorithms Using The Multiplicative Weights Update Method Satyen Kale A Dissertation
- Cited by 1 (1 self) – Add To MetaCart
-
Better Algorithms for Benign Bandits
- @(email omitted); Satyen Kale Microsoft Research One Microsoft Way, Redmond, WA 98052 satyen.kale@(email omitted); Abstract
- Add To MetaCart
-
A combinatorial, primal-dual approach to semidefinite programs
- A Combinatorial, Primal-Dual approach to Semidefinite Programs Sanjeev Arora ∗ Satyen Kale
- Cited by 12 (4 self) – Add To MetaCart
-
Research Interests
- Satyen Kale Curriculum Vitae Education 35 Olden Street Princeton, NJ 08540 (617) 872-4480 (cell
- Add To MetaCart
-
The Uniform Hardcore Lemma via Approximate Bregman Pro jections*
- ## Satyen Kale$ Abstract We give a simple, more efficient and uniform proof of thehard-core lemma, a
- Add To MetaCart
-
A Fast Random Sampling Algorithm for Sparsifying Matrices
- A Fast Random Sampling Algorithm for Sparsifying Matrices Sanjeev Arora ∗ Elad Hazan ∗ Satyen Kale
- Cited by 4 (1 self) – Add To MetaCart
-
The multiplicative weights update method: a meta algorithm and applications
- Hazan Satyen Kale Abstract Algorithms in varied fields use the idea of maintaining a distribution over a
- Cited by 15 (8 self) – Add To MetaCart
-
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
- Method Sanjeev Arora ∗ Elad Hazan Satyen Kale Computer Science Department, Princeton University 35 Olden
- Cited by 7 (4 self) – Add To MetaCart
-
O(plog n) approximation to SPARSEST CUT in ~O(n2) time
- O( √ log n) Approximation to Sparsest Cut in Õ(n2 ) Time Sanjeev Arora ∗ Elad Hazan Satyen Kale
- Cited by 1 (0 self) – Add To MetaCart

