| 2011 |
|---|
| 17 | Community structure and scale-free collections of Erdös-Rényi graphs. C. Seshadhri, Tamara G. Kolda, Ali Pinar. CoRR (abs/1112.3644) (2011). Web SearchBibTeXDownload |
| 16 | A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs. C. Seshadhri, Ali Pinar, Tamara G. Kolda. CoRR (abs/1102.5046) (2011). Web SearchBibTeXDownload |
| 15 | The Similarity between Stochastic Kronecker and Chung-Lu Graph Models. Ali Pinar, C. Seshadhri, Tamara G. Kolda. CoRR (abs/1110.4925) (2011). Web SearchBibTeXDownload |
| 14 | An In-depth Study of Stochastic Kronecker Graphs. C. Seshadhri, Ali Pinar, Tamara G. Kolda. ICDM 2011, 587-596. Web SearchBibTeXDownload |
| 13 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. ICS 2011, 367-388. Web SearchBibTeXDownload |
| 12 | Is Submodularity Testable?. C. Seshadhri, Jan Vondrák. ICS 2011, 195-210. Web SearchBibTeXDownload |
| 11 | Self-Improving Algorithms. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri. SIAM J. Comput. (40): 350-375 (2011). Web SearchBibTeXDownload |
| 10 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. SIAM J. Comput. (40): 709-720 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 9 | Finding Cycles and Trees in Sublinear Time. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler. CoRR (abs/1007.4230) (2010). Web SearchBibTeXDownload |
| 8 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. CoRR (abs/1008.3938) (2010). Web SearchBibTeXDownload |
| 7 | Is submodularity testable?. C. Seshadhri, Jan Vondrák. CoRR (abs/1008.0831) (2010). Web SearchBibTeXDownload |
| 6 | Self-improving Algorithms for Convex Hulls. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. SODA 2010, 1546-1565. Web SearchBibTeXDownload |
| 2009 |
|---|
| 5 | Self-Improving Algorithms. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri. CoRR (abs/0907.0884) (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 4 | Noise Tolerance of Expanders and Sublinear Expander Reconstruction. Satyen Kale, Yuval Peres, C. Seshadhri. FOCS 2008, 719-728. Web SearchBibTeXDownload |
| 3 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. ICALP (1) 2008, 527-538. Web SearchBibTeXDownload |
| 2 | Self-improving algorithms for delaunay triangulations. Kenneth L. Clarkson, C. Seshadhri. Symposium on Computational Geometry 2008, 148-155. Web SearchBibTeXDownload |
| 2007 |
|---|
| 1 | Testing Expansion in Bounded Degree Graphs. Satyen Kale, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
