( en | de | ru )

 

Disambiguation of "Jha, Madhav"

Author of the publication

copydeleteadd this publication to your clipboard
From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting

, , and . CoRR, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Deepti Jha

Development of a new cell penetrating peptide: design, synthesis and applications = Entwicklung eines neuen zell-penetrierenden Peptids. Uni Tübingen, (2009)

Vandana Jha

Madhav Pandey

Madhav Khadkikar

Madhav Date

 

Other publications of authors with the same name

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts., , and . WWW, page 495-505. ACM, (2015)Elastic Machine Learning Algorithms in Amazon SageMaker., , , , , , , , , and 14 other author(s). SIGMOD Conference, page 731-737. ACM, (2020)A space efficient streaming algorithm for triangle counting using the birthday paradox., , and . KDD, page 589-597. ACM, (2013)Testing Lipschitz Property over Product Distribution and its Applications to Statistical Data Privacy, , and . CoRR, (2012)Counting triangles in real-world graph streams: Dealing with repeated edges and time windows., , and . ACSSC, page 1507-1514. IEEE, (2015)From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting, , and . CoRR, (2012)A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox., , and . ACM Trans. Knowl. Discov. Data, 9 (3): 15:1-15:21 (2015)Counting Triangles in Graph Streams.. Encyclopedia of Algorithms, (2016)When a Graph is not so Simple: Counting Triangles in Multigraph Streams., , and . CoRR, (2013)Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts., , and . CoRR, (2014)