A space efficient streaming algorithm for triangle counting using the birthday paradox M Jha, C Seshadhri, A Pinar Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013 | 133 | 2013 |

Path sampling: A fast and provable method for estimating 4-vertex subgraph counts M Jha, C Seshadhri, A Pinar Proceedings of the 24th international conference on world wide web, 495-505, 2015 | 115 | 2015 |

Testing and reconstruction of Lipschitz functions with applications to data privacy M Jha, S Raskhodnikova SIAM Journal on Computing 42 (2), 700-731, 2013 | 84 | 2013 |

A space-efficient streaming algorithm for estimating transitivity and triangle counts using the birthday paradox M Jha, C Seshadhri, A Pinar ACM Transactions on Knowledge Discovery from Data (TKDD) 9 (3), 1-21, 2015 | 61 | 2015 |

Property testing on product distributions: Optimal testers for bounded derivative properties D Chakrabarty, K Dixit, M Jha, C Seshadhri ACM Transactions on Algorithms (TALG) 13 (2), 1-30, 2017 | 23 | 2017 |

Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... SIAM Journal on Discrete Mathematics 26 (2), 618-646, 2012 | 23 | 2012 |

Testing the Lipschitz property over product distributions with applications to data privacy K Dixit, M Jha, S Raskhodnikova, A Thakurta Theory of Cryptography Conference, 418-436, 2013 | 22 | 2013 |

Testing Lipschitz functions on hypergrid domains P Awasthi, M Jha, M Molinaro, S Raskhodnikova Algorithmica 74 (3), 1055-1081, 2016 | 21 | 2016 |

Elastic machine learning algorithms in amazon sagemaker E Liberty, Z Karnin, B Xiang, L Rouesnel, B Coskun, R Nallapati, ... Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020 | 20 | 2020 |

Lower bounds for local monotonicity reconstruction from transitive-closure spanners A Bhattacharyya, E Grigorescu, M Jha, K Jung, S Raskhodnikova, ... Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 17 | 2010 |

Counting triangles in real-world graph streams: Dealing with repeated edges and time windows M Jha, A Pinar, C Seshadhri 2015 49th Asilomar Conference on Signals, Systems and Computers, 1507-1514, 2015 | 12 | 2015 |

From the birthday paradox to a practical sublinear space streaming algorithm for triangle counting M Jha, C Seshadhri, A Pinar CoRR, abs/1212.2264 1, 2, 2012 | 5 | 2012 |

Limitations of local filters of lipschitz and monotone functions P Awasthi, M Jha, M Molinaro, S Raskhodnikova ACM Transactions on Computation Theory (TOCT) 7 (1), 1-16, 2015 | 4 | 2015 |

When a Graph is not so Simple: Counting Triangles in Multigraph Streams. M Jha, S Comandur, A Pinar Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2013 | 4 | 2013 |

Optimal lower bounds for Lipschitz testing via monotonicity D Chakrabarty, K Dixit, M Jha, C Seshadhri Private communication, 2013 | 4 | 2013 |

Online training with delayed feedback M Jha, E Liberty US Patent 10,839,809, 2020 | | 2020 |

Machine learning model assisted enhancement of audio and/or visual communications M Jha, E Liberty US Patent 10,482,887, 2019 | | 2019 |

Counting Triangles in Real-World Graph Streams: Dealing with Repeated Edges and Time Windows. A Pinar, M Jha, C Seshadhri Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2015 | | 2015 |

Path Sampling: A Fast and Provable Method for Estimating 4-vertex subgraph counts. A Pinar, M Jha, C Seshadhri Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2015 | | 2015 |

Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. S Comandur, A Pinar, M Jha Sandia National Lab.(SNL-CA), Livermore, CA (United States), 2014 | | 2014 |