# Seshadhri Comandur

According to our database

Collaborative distances:

^{1}, Seshadhri Comandur authored at least 124 papers between 2006 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2021

Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes.

Electron. Colloquium Comput. Complex., 2021

CoRR, 2021

CoRR, 2021

Random walks and forbidden minors III: poly(d/ε)-time partition oracles for minor-free graph classes.

CoRR, 2021

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Theory Comput., 2020

SIAM J. Comput., 2020

SIAM J. Comput., 2020

Proc. Natl. Acad. Sci. USA, 2020

CoRR, 2020

Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS.

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020

Faster sublinear approximation of the number of <i>k</i>-cliques in low-arboricity graphs.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Domain Reduction for Monotonicity Testing: A <i>o</i>(<i>d</i>) Tester for Boolean Functions in <i>d</i>-Dimensions.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019

Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection.

SIAM J. Discret. Math., 2019

andom walks and forbidden minors II: A $\poly(d\eps^{-1})$-query tester for minor-closed properties of bounded degree graphs.

Electron. Colloquium Comput. Complex., 2019

Random walks and forbidden minors II: A poly(dε<sup>-1</sup>)-query tester for minor-closed properties of bounded-degree graphs.

CoRR, 2019

Random walks and forbidden minors II: a poly(<i>d ε</i><sup>-1</sup>)-query tester for minor-closed properties of bounded degree graphs.

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Proc. VLDB Endow., 2018

Finding forbidden minors in sublinear time: a O(n<sup>1/2+o(1)</sup>)-query one-sided tester for minor closed properties on bounded degree graphs.

Electron. Colloquium Comput. Complex., 2018

Electron. Colloquium Comput. Complex., 2018

Domain Reduction for Monotonicity Testing: A $o(d)$ Tester for Boolean Functions on Hypergrids.

Electron. Colloquium Comput. Complex., 2018

Finding forbidden minors in sublinear time: a n<sup>1/2+o(1)</sup>-query one-sided tester for minor closed properties on bounded degree graphs.

Electron. Colloquium Comput. Complex., 2018

CoRR, 2018

Fiding forbidden minors in sublinear time: a O(n<sup>1/2 + o(1)</sup>)-query one-sided tester for minor closed properties on bounded degree graphs.

CoRR, 2018

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

A <i>o</i>(<i>d</i>) · polylog <i>n</i> Monotonicity Tester for Boolean Functions over the Hypergrid [<i>n</i>]<sup><i>d</i></sup>.

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs.

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

ACM Trans. Web, 2017

Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties.

ACM Trans. Algorithms, 2017

SIAM J. Comput., 2017

SIAM J. Comput., 2017

A o(d) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [n]<sup>d</sup>.

Electron. Colloquium Comput. Complex., 2017

A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness of Boolean Functions over the Hypercube.

Electron. Colloquium Comput. Complex., 2017

Discret. Comput. Geom., 2017

A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid [n]<sup>d</sup>.

CoRR, 2017

CoRR, 2017

J. Complex Networks, 2017

When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors.

Proceedings of the 26th International Conference on World Wide Web, 2017

Proceedings of the 26th International Conference on World Wide Web, 2017

Proceedings of the 26th International Conference on World Wide Web, 2017

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection.

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Encyclopedia of Algorithms, 2016

SIAM J. Sci. Comput., 2016

SIAM J. Comput., 2016

SIAM J. Comput., 2016

Electron. Colloquium Comput. Complex., 2016

CoRR, 2016

2015

A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox.

ACM Trans. Knowl. Discov. Data, 2015

Internet Math., 2015

CoRR, 2015

J. Complex Networks, 2015

Proceedings of the 24th International Conference on World Wide Web, 2015

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts.

Proceedings of the 24th International Conference on World Wide Web, 2015

Catching the Head, Tail, and Everything in Between: A Streaming Algorithm for the Degree Distribution.

Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows.

Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

Proceedings of the Green in Software Engineering, 2015

2014

Theory Comput., 2014

SIAM J. Sci. Comput., 2014

SIAM J. Sci. Comput., 2014

SIAM J. Comput., 2014

Wedge sampling for computing clustering coefficients and triangle counts on large graphs.

Stat. Anal. Data Min., 2014

Characterizing short-term stability for Boolean networks over any distribution of transfer functions.

CoRR, 2014

CoRR, 2014

Algorithmica, 2014

Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013

SIAM J. Comput., 2013

J. ACM, 2013

From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits.

J. ACM, 2013

Electron. Colloquium Comput. Complex., 2013

CoRR, 2013

CoRR, 2013

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids.

Proceedings of the Symposium on Theory of Computing Conference, 2013

Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Proceedings of the 13th SIAM International Conference on Data Mining, 2013

A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal.

Proceedings of the 2nd IEEE Network Science Workshop, 2013

Proceedings of the IEEE Symposium on Large-Scale Data Analysis and Visualization, 2013

A space efficient streaming algorithm for triangle counting using the birthday paradox.

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012

Electron. Colloquium Comput. Complex., 2012

Electron. Colloquium Comput. Complex., 2012

From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting

CoRR, 2012

CoRR, 2012

CoRR, 2012

CoRR, 2012

CoRR, 2012

Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods.

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

SIAM J. Comput., 2011

SIAM J. Comput., 2011

J. ACM, 2011

CoRR, 2011

CoRR, 2011

CoRR, 2011

CoRR, 2011

Proceedings of the Innovations in Computer Science, 2011

Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010

SIAM J. Comput., 2010

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter.

Electron. Colloquium Comput. Complex., 2010

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box Identity Test for Depth-3 Circuits.

Electron. Colloquium Comput. Complex., 2010

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Proceedings of the Property Testing - Current Research and Surveys, 2010

2009

CoRR, 2009

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2008

Electron. Colloquium Comput. Complex., 2008

Algorithmica, 2008

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Random Struct. Algorithms, 2007

Fundam. Informaticae, 2007

Electron. Colloquium Comput. Complex., 2007

Electron. Colloquium Comput. Complex., 2007

2006

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006