# Madhav Jha

According to our database

Collaborative distances:

^{1}, Madhav Jha authored at least 14 papers between 2011 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

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

ACM Trans. Algorithms, 2017

2016

Counting Triangles in Graph Streams.

Encyclopedia of Algorithms, 2016

Testing Lipschitz Functions on Hypergrid Domains.

Algorithmica, 2016

2015

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

TKDD, 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

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

2013

When a Graph is not so Simple: Counting Triangles in Multigraph Streams.

CoRR, 2013

Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy.

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 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

Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners.

SIAM J. Discrete Math., 2012

Limitations of Local Filters of Lipschitz and Monotone Functions.

Electronic Colloquium on Computational Complexity (ECCC), 2012

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

CoRR, 2012

Testing Lipschitz Property over Product Distribution and its Applications to Statistical Data Privacy

CoRR, 2012

2011

Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy.

Electronic Colloquium on Computational Complexity (ECCC), 2011