Seshadhri Comandur (Selection)

C. Seshadhri

Information Security Sciences Department, Sandia National Laboratories

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

43 Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388

33 Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. 40(3): 709-720 (2011)

25 Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks CoRR abs/1008.3938: (2010)

16 Satyen Kale, Yuval Peres, C. Seshadhri: Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728

15 Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. ICALP (1) 2008: 527-538

9 Satyen Kale, C. Seshadhri: Testing Expansion in Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(076): (2007)

Selection of 6 from 57 records - Seshadhri Comandur has 28 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

43		Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388
33		Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. 40(3): 709-720 (2011)
25		Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks CoRR abs/1008.3938: (2010)
16		Satyen Kale, Yuval Peres, C. Seshadhri: Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728
15		Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. ICALP (1) 2008: 527-538
9		Satyen Kale, C. Seshadhri: Testing Expansion in Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(076): (2007)