| | |
C. Seshadhri
Information Security Sciences Department, Sandia National Laboratories
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 52 |      | Jaideep Ray, Ali Pinar, C. Seshadhri: Are we there yet? When to stop a Markov chain while generating random graphs CoRR abs/1202.3473: (2012) |
| 51 | | C. Seshadhri, Ali Pinar, Tamara G. Kolda: Fast Triangle Counting through Wedge Sampling CoRR abs/1202.5230: (2012) |
| 50 | | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving Algorithms for Coordinate-wise Maxima CoRR abs/1204.0824: (2012) |
| 49 | | Deeparnab Chakrabarty, C. Seshadhri: Optimal bounds for monotonicity and Lipschitz testing over the hypercube CoRR abs/1204.0849: (2012) |
| 48 | | Michael Saks, C. Seshadhri: Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance CoRR abs/1204.1098: (2012) |
| 47 | | Deeparnab Chakrabarty, C. Seshadhri: Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Electronic Colloquium on Computational Complexity (ECCC) 19: 30 (2012) |
| 46 | | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler: Finding Cycles and Trees in Sublinear Time. Electronic Colloquium on Computational Complexity (ECCC) 19: 35 (2012) |
| 2011 | ||
| 45 | | C. Seshadhri, Ali Pinar, Tamara G. Kolda: An In-depth Study of Stochastic Kronecker Graphs. ICDM 2011: 587-596 |
| 44 | | C. Seshadhri, Jan Vondrák: Is Submodularity Testable? ICS 2011: 195-210 |
| 43 | | Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388 |
| 42 | | Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. STOC 2011: 431-440 |
| 41 | | C. Seshadhri, Ali Pinar, Tamara G. Kolda: A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs CoRR abs/1102.5046: (2011) |
| 40 | | C. Seshadhri, Yevgeniy Vorobeychik, Jackson Mayo, Robert C. Armstrong, Joseph R. Ruthruff: Influence and Dynamic Behavior in Random Boolean Networks CoRR abs/1107.3792: (2011) |
| 39 | | Ali Pinar, C. Seshadhri, Tamara G. Kolda: The Similarity between Stochastic Kronecker and Chung-Lu Graph Models CoRR abs/1110.4925: (2011) |
| 38 | | David Gleich, C. Seshadhri: Neighborhoods are good communities CoRR abs/1112.0031: (2011) |
| 37 | | C. Seshadhri, Tamara G. Kolda, Ali Pinar: Community structure and scale-free collections of Erdös-Rényi graphs CoRR abs/1112.3644: (2011) |
| 36 | | Bernard Chazelle, C. Seshadhri: Online geometric reconstruction. J. ACM 58(4): 14 (2011) |
| 35 | | Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. 40(1): 200-224 (2011) |
| 34 | | Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) |
| 33 | | Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. 40(3): 709-720 (2011) |
| 2010 | ||
| 32 | | Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. FOCS 2010: 21-29 |
| 31 | | Michael Saks, C. Seshadhri: Estimating the Longest Increasing Sequence in Polylogarithmic Time. FOCS 2010: 458-467 |
| 30 | | Michael Saks, C. Seshadhri: Local Property Reconstruction and Monotonicity. Property Testing 2010: 346-354 |
| 29 | | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri: Self-improving Algorithms for Convex Hulls. SODA 2010: 1546-1565 |
| 28 | | Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits CoRR abs/1002.0145: (2010) |
| 27 | | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler: Finding Cycles and Trees in Sublinear Time CoRR abs/1007.4230: (2010) |
| 26 | | C. Seshadhri, Jan Vondrák: Is submodularity testable? CoRR abs/1008.0831: (2010) |
| 25 | | Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks CoRR abs/1008.3938: (2010) |
| 24 | | Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter CoRR abs/1011.3234: (2010) |
| 23 | | Nitin Saxena, C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Electronic Colloquium on Computational Complexity (ECCC) 17: 13 (2010) |
| 22 | | Nitin Saxena, C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Electronic Colloquium on Computational Complexity (ECCC) 17: 167 (2010) |
| 21 | | Michael E. Saks, C. Seshadhri: Local Monotonicity Reconstruction. SIAM J. Comput. 39(7): 2897-2926 (2010) |
| 2009 | ||
| 20 | | Elad Hazan, C. Seshadhri: Efficient learning algorithms for changing environments. ICML 2009: 50 |
| 19 | | Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. IEEE Conference on Computational Complexity 2009: 137-148 |
| 18 | | C. Seshadhri: Testing cycle-freeness: Finding a certificate CoRR abs/0906.5010: (2009) |
| 17 | | Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms CoRR abs/0907.0884: (2009) |
| 2008 | ||
| 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 |
| 14 | | Michael E. Saks, C. Seshadhri: Parallel monotonicity reconstruction. SODA 2008: 962-971 |
| 13 | | Kenneth L. Clarkson, C. Seshadhri: Self-improving algorithms for delaunay triangulations. Symposium on Computational Geometry 2008: 148-155 |
| 12 | | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008) |
| 11 | | Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities CoRR abs/0811.3161: (2008) |
| 10 | | Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. Electronic Colloquium on Computational Complexity (ECCC) 15(108): (2008) |
| 2007 | ||
| 9 | | Satyen Kale, C. Seshadhri: Testing Expansion in Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(076): (2007) |
| 8 | | Elad Hazan, C. Seshadhri: Adaptive Algorithms for Online Decision Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088): (2007) |
| 7 | | Seshadhri Comandur, Anil Seth, Somenath Biswas: RAM Simulation of BGS Model of Abstract-state Machines. Fundam. Inform. 77(1-2): 175-185 (2007) |
| 6 | | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007) |
| 2006 | ||
| 5 | | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Self-improving algorithms. SODA 2006: 261-270 |
| 4 | | Bernard Chazelle, C. Seshadhri: Online geometric reconstruction. Symposium on Computational Geometry 2006: 386-394 |
| 2005 | ||
| 3 | | Seshadhri Comandur, Anil Seth, Somenath Biswas: RAM Simulation of BGS Model of Abstract State Machines. Abstract State Machines 2005: 377-386 |
| 2004 | ||
| 2 | | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236 |
| 1 | | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. ISAAC 2004: 16-27 |
| 1 | Nir Ailon | [1] [2] [5] [6] [12] [17] [34] |
| 2 | Robert C. Armstrong | [40] |
| 3 | Somenath Biswas | [3] [7] |
| 4 | Deeparnab Chakrabarty | [47] [49] |
| 5 | Bernard Chazelle | [1] [2] [4] [5] [6] [12] [17] [34] [36] |
| 6 | Kenneth L. Clarkson | [13] [17] [29] [34] [50] |
| 7 | Artur Czumaj | [27] [46] |
| 8 | David F. Gleich (David Gleich) | [38] |
| 9 | Oded Goldreich | [27] [46] |
| 10 | Elad Hazan | [8] [20] |
| 11 | Satyen Kale | [9] [15] [16] [25] [33] [43] |
| 12 | Tamara G. Kolda | [37] [39] [41] [45] [51] |
| 13 | Ding Liu | [1] [2] [5] [6] [12] [17] [34] |
| 14 | Jackson Mayo | [40] |
| 15 | Wolfgang Mulzer (Wolfgang Johann Heinrich Mulzer) | [17] [29] [34] [50] |
| 16 | Yuval Peres | [16] |
| 17 | Ali Pinar | [37] [39] [41] [45] [51] [52] |
| 18 | Jaideep Ray | [52] |
| 19 | Dana Ron | [27] [46] |
| 20 | Joseph R. Ruthruff | [40] |
| 21 | Michael E. Saks (Michael Saks) | [14] [21] [30] [31] [48] |
| 22 | Nitin Saxena | [10] [11] [19] [22] [23] [24] [28] [32] [35] [42] |
| 23 | Anil Seth | [3] [7] |
| 24 | Asaf Shapira | [27] [46] |
| 25 | Christian Sohler | [27] [46] |
| 26 | Jan Vondrák | [26] [44] |
| 27 | Yevgeniy Vorobeychik | [40] |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page