default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMadhav Jha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c10]Edo Liberty, Zohar S. Karnin, Bing Xiang, Laurence Rouesnel, Baris Coskun, Ramesh Nallapati, Julio Delgado, Amir Sadoughi, Yury Astashonok, Piali Das, Can Balioglu, Saswata Chakravarty, Madhav Jha, Philip Gautier, David Arpin, Tim Januschowski, Valentin Flunkert, Yuyang Wang, Jan Gasthaus, Lorenzo Stella, Syama Sundar Rangapuram, David Salinas, Sebastian Schelter, Alex Smola:
Elastic Machine Learning Algorithms in Amazon SageMaker. SIGMOD Conference 2020: 731-737
2010 – 2019
- 2017
- [j6]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. ACM Trans. Algorithms 13(2): 20:1-20:30 (2017) - 2016
- [j5]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. Algorithmica 74(3): 1055-1081 (2016) - [r1]Madhav Jha:
Counting Triangles in Graph Streams. Encyclopedia of Algorithms 2016: 458-464 - 2015
- [j4]Madhav Jha, C. Seshadhri, Ali Pinar:
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox. ACM Trans. Knowl. Discov. Data 9(3): 15:1-15:21 (2015) - [c9]Madhav Jha, Ali Pinar, C. Seshadhri:
Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC 2015: 1507-1514 - [c8]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. SODA 2015: 1809-1828 - [c7]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW 2015: 495-505 - 2014
- [j3]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. ACM Trans. Comput. Theory 7(1): 2:1-2:16 (2014) - [i9]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. CoRR abs/1404.0718 (2014) - [i8]Madhav Jha, C. Seshadhri, Ali Pinar:
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. CoRR abs/1411.4942 (2014) - [i7]Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j2]Madhav Jha, Sofya Raskhodnikova:
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy. SIAM J. Comput. 42(2): 700-731 (2013) - [c6]Madhav Jha, C. Seshadhri, Ali Pinar:
A space efficient streaming algorithm for triangle counting using the birthday paradox. KDD 2013: 589-597 - [c5]Kashyap Dixit, Madhav Jha, Sofya Raskhodnikova, Abhradeep Thakurta:
Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy. TCC 2013: 418-436 - [i6]Madhav Jha, C. Seshadhri, Ali Pinar:
When a Graph is not so Simple: Counting Triangles in Multigraph Streams. CoRR abs/1310.7665 (2013) - 2012
- [j1]Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. SIAM J. Discret. Math. 26(2): 618-646 (2012) - [c4]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. APPROX-RANDOM 2012: 374-386 - [c3]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. APPROX-RANDOM 2012: 387-398 - [i5]Kashyap Dixit, Madhav Jha, Abhradeep Thakurta:
Testing Lipschitz Property over Product Distribution and its Applications to Statistical Data Privacy. CoRR abs/1209.4056 (2012) - [i4]Madhav Jha, C. Seshadhri, Ali Pinar:
From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting. CoRR abs/1212.2264 (2012) - [i3]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Limitations of Local Filters of Lipschitz and Monotone Functions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i2]Pranjal Awasthi, Madhav Jha, Marco Molinaro, Sofya Raskhodnikova:
Testing Lipschitz Functions on Hypergrid Domains. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c2]Madhav Jha, Sofya Raskhodnikova:
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy. FOCS 2011: 433-442 - [i1]Madhav Jha, Sofya Raskhodnikova:
Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c1]Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff:
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners. APPROX-RANDOM 2010: 448-461
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
