| 2013 |
|---|
| 58 | Counting Triangles in Massive Graphs with MapReduce. Tamara G. Kolda, Ali Pinar, Todd Plantenga, C. Seshadhri, Christine Task. CoRR (abs/1301.5887) (2013). Web SearchBibTeXDownload |
| 57 | The importance of directed triangles with reciprocity: patterns and algorithms. C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda. CoRR (abs/1302.6220) (2013). Web SearchBibTeXDownload |
| 56 | A Scalable Generative Graph Model with Community Structure. Tamara G. Kolda, Ali Pinar, Todd Plantenga, C. Seshadhri. CoRR (abs/1302.6636) (2013). Web SearchBibTeXDownload |
| 55 | A o(n) monotonicity tester for Boolean functions over the hypercube. Deeparnab Chakrabarty, C. Seshadhri. CoRR (abs/1302.4536) (2013). Web SearchBibTeXDownload |
| 54 | A {\\huge ${o(n)}$} monotonicity tester for Boolean functions over the hypercube. Deeparnab Chakrabarty, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (20): 29 (2013). Web SearchBibTeXDownload |
| 53 | Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. Satyen Kale, Yuval Peres, C. Seshadhri. SIAM J. Comput. (42): 305-323 (2013). Web SearchBibTeXDownload |
| 2012 |
|---|
| 52 | Degree relations of triangles in real-world networks and graph models. Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri. CIKM 2012, 1712-1716. Web SearchBibTeXDownload |
| 51 | Degree Relations of Triangles in Real-world Networks and Models. Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri. CoRR (abs/1207.7125) (2012). Web SearchBibTeXDownload |
| 50 | Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. Michael Saks, C. Seshadhri. CoRR (abs/1204.1098) (2012). Web SearchBibTeXDownload |
| 49 | Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. CoRR (abs/1211.0952) (2012). Web SearchBibTeXDownload |
| 48 | Self-improving Algorithms for Coordinate-wise Maxima. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. CoRR (abs/1204.0824) (2012). Web SearchBibTeXDownload |
| 47 | Are we there yet? When to stop a Markov chain while generating random graphs. Jaideep Ray, Ali Pinar, C. Seshadhri. CoRR (abs/1202.3473) (2012). Web SearchBibTeXDownload |
| 46 | A stopping criterion for Markov chains when generating independent random graphs. Jaideep Ray, Ali Pinar, C. Seshadhri. CoRR (abs/1210.8184) (2012). Web SearchBibTeXDownload |
| 45 | From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting. Madhav Jha, C. Seshadhri, Ali Pinar. CoRR (abs/1212.2264) (2012). Web SearchBibTeXDownload |
| 44 | A scalable directed graph model with reciprocal edges. Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri. CoRR (abs/1210.5288) (2012). Web SearchBibTeXDownload |
| 43 | Fast Triangle Counting through Wedge Sampling. C. Seshadhri, Ali Pinar, Tamara G. Kolda. CoRR (abs/1202.5230) (2012). Web SearchBibTeXDownload |
| 42 | Finding Cycles and Trees in Sublinear Time. Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler. Electronic Colloquium on Computational Complexity (ECCC) (19): 35 (2012). Web SearchBibTeXDownload |
| 41 | Optimal bounds for monotonicity and Lipschitz testing over the hypercube. Deeparnab Chakrabarty, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (19): 30 (2012). Web SearchBibTeXDownload |
| 40 | Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. David F. Gleich, C. Seshadhri. KDD 2012, 597-605. Web SearchBibTeXDownload |
| 39 | The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. C. Seshadhri, Ali Pinar, Tamara G. Kolda. SDM 2012, 1071-1082. Web SearchBibTeXDownload |
| 38 | Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter. Nitin Saxena, C. Seshadhri. SIAM J. Comput. (41): 1285-1298 (2012). Web SearchBibTeXDownload |
| 37 | Self-improving algorithms for coordinate-wise maxima. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. Symposium on Computational Geometry 2012, 277-286. Web SearchBibTeXDownload |
| 36 | Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. Jaideep Ray, Ali Pinar, C. Seshadhri. WAW 2012, 153-164. Web SearchBibTeXDownload |
| 2011 |
|---|
| 35 | Influence and Dynamic Behavior in Random Boolean Networks. C. Seshadhri, Yevgeniy Vorobeychik, Jackson Mayo, Robert C. Armstrong, Joseph R. Ruthruff. CoRR (abs/1107.3792) (2011). Web SearchBibTeXDownload |
| 34 | The Similarity between Stochastic Kronecker and Chung-Lu Graph Models. Ali Pinar, C. Seshadhri, Tamara G. Kolda. CoRR (abs/1110.4925) (2011). Web SearchBibTeXDownload |
| 33 | 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 |
| 32 | Neighborhoods are good communities. David Gleich, C. Seshadhri. CoRR (abs/1112.0031) (2011). Web SearchBibTeXDownload |
| 31 | 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 |
| 30 | An In-depth Study of Stochastic Kronecker Graphs. C. Seshadhri, Ali Pinar, Tamara G. Kolda. ICDM 2011, 587-596. Web SearchBibTeXDownload |
| 29 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. ICS 2011, 367-388. Web SearchBibTeXDownload |
| 28 | Is Submodularity Testable?. C. Seshadhri, Jan Vondrák. ICS 2011, 195-210. Web SearchBibTeXDownload |
| 27 | Online geometric reconstruction. Bernard Chazelle, C. Seshadhri. J. ACM (58): 14 (2011). Web SearchBibTeXDownload |
| 26 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. SIAM J. Comput. (40): 709-720 (2011). Web SearchBibTeXDownload |
| 25 | An Almost Optimal Rank Bound for Depth-3 Identities. Nitin Saxena, C. Seshadhri. SIAM J. Comput. (40): 200-224 (2011). Web SearchBibTeXDownload |
| 24 | 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 |
| 23 | Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Nitin Saxena, C. Seshadhri. STOC 2011, 431-440. Web SearchBibTeXDownload |
| 2010 |
|---|
| 22 | 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 |
| 21 | Is submodularity testable?. C. Seshadhri, Jan Vondrák. CoRR (abs/1008.0831) (2010). Web SearchBibTeXDownload |
| 20 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. CoRR (abs/1008.3938) (2010). Web SearchBibTeXDownload |
| 19 | From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits. Nitin Saxena, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (17): 13 (2010). Web SearchBibTeXDownload |
| 18 | Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. Nitin Saxena, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (17): 167 (2010). Web SearchBibTeXDownload |
| 17 | Estimating the Longest Increasing Sequence in Polylogarithmic Time. Michael Saks, C. Seshadhri. FOCS 2010, 458-467. Web SearchBibTeXDownload |
| 16 | From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. Nitin Saxena, C. Seshadhri. FOCS 2010, 21-29. Web SearchBibTeXDownload |
| 15 | Local Property Reconstruction and Monotonicity. Michael Saks, C. Seshadhri. Property Testing 2010, 346-354. Web SearchBibTeXDownload |
| 14 | Local Monotonicity Reconstruction. Michael E. Saks, C. Seshadhri. SIAM J. Comput. (39): 2897-2926 (2010). Web SearchBibTeXDownload |
| 13 | Self-improving Algorithms for Convex Hulls. Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. SODA 2010, 1546-1565. Web SearchBibTeXDownload |
| 2009 |
|---|
| 12 | Testing cycle-freeness: Finding a certificate. C. Seshadhri. CoRR (abs/0906.5010) (2009). Web SearchBibTeXDownload |
| 11 | Self-Improving Algorithms. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri. CoRR (abs/0907.0884) (2009). Web SearchBibTeXDownload |
| 10 | Efficient learning algorithms for changing environments. Elad Hazan, C. Seshadhri. ICML 2009, 50. Web SearchBibTeXDownload |
| 9 | An Almost Optimal Rank Bound for Depth-3 Identities. Nitin Saxena, C. Seshadhri. IEEE Conference on Computational Complexity 2009, 137-148. Web SearchBibTeXDownload |
| 2008 |
|---|
| 8 | An Almost Optimal Rank Bound for Depth-3 Identities. Nitin Saxena, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (15) (2008). Web SearchBibTeXDownload |
| 7 | Noise Tolerance of Expanders and Sublinear Expander Reconstruction. Satyen Kale, Yuval Peres, C. Seshadhri. FOCS 2008, 719-728. Web SearchBibTeXDownload |
| 6 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. ICALP (1) 2008, 527-538. Web SearchBibTeXDownload |
| 5 | Parallel monotonicity reconstruction. Michael E. Saks, C. Seshadhri. SODA 2008, 962-971. Web SearchBibTeXDownload |
| 4 | Self-improving algorithms for delaunay triangulations. Kenneth L. Clarkson, C. Seshadhri. Symposium on Computational Geometry 2008, 148-155. Web SearchBibTeXDownload |
| 2007 |
|---|
| 3 | Adaptive Algorithms for Online Decision Problems. Elad Hazan, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
| 2 | Testing Expansion in Bounded Degree Graphs. Satyen Kale, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 1 | Online geometric reconstruction. Bernard Chazelle, C. Seshadhri. Symposium on Computational Geometry 2006, 386-394. Web SearchBibTeXDownload |
