| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Deeparnab Chakrabarty, C. Seshadhri |
Optimal bounds for monotonicity and Lipschitz testing over the hypercube.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2012 |
DBLP BibTeX RDF |
|
| 1 | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
Fast Triangle Counting through Wedge Sampling |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jaideep Ray, Ali Pinar, C. Seshadhri |
Are we there yet? When to stop a Markov chain while generating random graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Deeparnab Chakrabarty, C. Seshadhri |
Optimal bounds for monotonicity and Lipschitz testing over the hypercube |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri |
Self-improving Algorithms for Coordinate-wise Maxima |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Michael Saks, C. Seshadhri |
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Bernard Chazelle, C. Seshadhri |
Online geometric reconstruction. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Gleich, C. Seshadhri |
Neighborhoods are good communities |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | C. Seshadhri, Yevgeniy Vorobeychik, Jackson Mayo, Robert C. Armstrong, Joseph R. Ruthruff |
Influence and Dynamic Behavior in Random Boolean Networks |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ali Pinar, C. Seshadhri, Tamara G. Kolda |
The Similarity between Stochastic Kronecker and Chung-Lu Graph Models |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | C. Seshadhri, Tamara G. Kolda, Ali Pinar |
Community structure and scale-free collections of Erdös-Rényi graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri |
Self-Improving Algorithms. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
An Expansion Tester for Bounded Degree Graphs. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
An Almost Optimal Rank Bound for Depth-3 Identities. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Seshadhri, Ali Pinar, Tamara G. Kolda |
An In-depth Study of Stochastic Kronecker Graphs. |
ICDM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Seshadhri, Jan Vondrák |
Is Submodularity Testable? |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
Combinatorial Approximation Algorithms for MaxCut using Random Walks. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadhri, Asaf Shapira, Christian Sohler |
Finding Cycles and Trees in Sublinear Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | C. Seshadhri, Jan Vondrák |
Is submodularity testable? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
Combinatorial Approximation Algorithms for MaxCut using Random Walks |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael E. Saks, C. Seshadhri |
Local Monotonicity Reconstruction. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri |
Self-improving Algorithms for Convex Hulls. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Saks, C. Seshadhri |
Local Property Reconstruction and Monotonicity. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Saks, C. Seshadhri |
Estimating the Longest Increasing Sequence in Polylogarithmic Time. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Seshadhri |
Testing cycle-freeness: Finding a certificate |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri |
Self-Improving Algorithms |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elad Hazan, C. Seshadhri |
Efficient learning algorithms for changing environments. |
ICML |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
An Almost Optimal Rank Bound for Depth-3 Identities. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
An Almost Optimal Rank Bound for Depth-3 Identities. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nitin Saxena, C. Seshadhri |
An Almost Optimal Rank Bound for Depth-3 Identities |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael E. Saks, C. Seshadhri |
Parallel monotonicity reconstruction. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
An Expansion Tester for Bounded Degree Graphs. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, C. Seshadhri |
Self-improving algorithms for delaunay triangulations. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
delaunay triangulations |
| 1 | Satyen Kale, Yuval Peres, C. Seshadhri |
Noise Tolerance of Expanders and Sublinear Expander Reconstruction. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Property-Preserving Data Reconstruction. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Monotonicity testing, Sublinear algorithms |
| 1 | Elad Hazan, C. Seshadhri |
Adaptive Algorithms for Online Decision Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Satyen Kale, C. Seshadhri |
Testing Expansion in Bounded Degree Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Estimating the distance to a monotone function. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Seshadhri Comandur, Anil Seth, Somenath Biswas |
RAM Simulation of BGS Model of Abstract-state Machines. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Bernard Chazelle, C. Seshadhri |
Online geometric reconstruction. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
computational geometry, sublinear algorithms |
| 1 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Self-improving algorithms. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Seshadhri Comandur, Anil Seth, Somenath Biswas |
RAM Simulation of BGS Model of Abstract State Machines. |
Abstract State Machines |
2005 |
DBLP BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Estimating the Distance to a Monotone Function. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
Property-Preserving Data Reconstruction. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")