| * | 2009 |
|---|
| 12 | EE | Elad Hazan,
C. Seshadhri:
Efficient learning algorithms for changing environments.
ICML 2009: 50 |
| 11 | EE | C. Seshadhri:
Testing cycle-freeness: Finding a certificate
CoRR abs/0906.5010: (2009) |
| 10 | EE | Nir Ailon,
Bernard Chazelle,
Kenneth L. Clarkson,
Ding Liu,
Wolfgang Mulzer,
C. Seshadhri:
Self-Improving Algorithms
CoRR abs/0907.0884: (2009) |
| 2008 |
|---|
| 9 | EE | Satyen Kale,
Yuval Peres,
C. Seshadhri:
Noise Tolerance of Expanders and Sublinear Expander Reconstruction.
FOCS 2008: 719-728 |
| 8 | EE | Satyen Kale,
C. Seshadhri:
An Expansion Tester for Bounded Degree Graphs.
ICALP (1) 2008: 527-538 |
| 7 | EE | Michael E. Saks,
C. Seshadhri:
Parallel monotonicity reconstruction.
SODA 2008: 962-971 |
| 6 | EE | Kenneth L. Clarkson,
C. Seshadhri:
Self-improving algorithms for delaunay triangulations.
Symposium on Computational Geometry 2008: 148-155 |
| 5 | EE | Nitin Saxena,
C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities
CoRR abs/0811.3161: (2008) |
| 4 | EE | Nitin Saxena,
C. Seshadhri:
An Almost Optimal Rank Bound for Depth-3 Identities.
Electronic Colloquium on Computational Complexity (ECCC) 15(108): (2008) |
| 2007 |
|---|
| 3 | EE | Satyen Kale,
C. Seshadhri:
Testing Expansion in Bounded Degree Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(076): (2007) |
| 2 | EE | Elad Hazan,
C. Seshadhri:
Adaptive Algorithms for Online Decision Problems.
Electronic Colloquium on Computational Complexity (ECCC) 14(088): (2007) |
| 2006 |
|---|
| 1 | EE | Bernard Chazelle,
C. Seshadhri:
Online geometric reconstruction.
Symposium on Computational Geometry 2006: 386-394 |
