![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 49 matches
- 2024
- Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang:
The Discrepancy of Shortest Paths. ICALP 2024: 27:1-27:20 - Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. SODA 2024: 995-1018 - Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou:
Optimal Bounds on Private Graph Approximation. SODA 2024: 1019-1049 - Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay, Chen Wang:
The Discrepancy of Shortest Paths. CoRR abs/2401.15781 (2024) - Edwige Cyffers, Aurélien Bellet, Jalaj Upadhyay:
Differentially Private Decentralized Learning with Random Walks. CoRR abs/2402.07471 (2024) - Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou:
Optimality of Matrix Mechanism on ℓpp-metric. CoRR abs/2406.02140 (2024) - Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou:
Almost linear time differentially private release of synthetic graphs. CoRR abs/2406.02156 (2024) - Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, Jalaj Upadhyay:
Continual Counting with Gradual Privacy Expiration. CoRR abs/2406.03802 (2024) - 2023
- Arun Ganesh, Abhradeep Thakurta, Jalaj Upadhyay:
Universality of Langevin Diffusion for Private Optimization, with Applications to Sampling from Rashomon Sets. COLT 2023: 1730-1773 - Hendrik Fichtenberger, Monika Henzinger, Jalaj Upadhyay:
Constant Matters: Fine-grained Error Bound on Differentially Private Continual Observation. ICML 2023: 10072-10092 - Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. SODA 2023: 5003-5039 - Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang:
Differentially Private Range Query on Shortest Paths. WADS 2023: 340-370 - Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. CoRR abs/2307.08970 (2023) - Jingcheng Liu, Jalaj Upadhyay, Zongrui Zou:
Optimal Bounds on Private Graph Approximation. CoRR abs/2309.17330 (2023) - 2022
- Monika Henzinger, Jalaj Upadhyay:
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. CoRR abs/2202.11205 (2022) - Arun Ganesh, Abhradeep Thakurta, Jalaj Upadhyay:
Langevin Diffusion: An Almost Universal Algorithm for Private Euclidean (Convex) Optimization. CoRR abs/2204.01585 (2022) - Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. CoRR abs/2211.05006 (2022) - Monika Henzinger, Jalaj Upadhyay:
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation Using Completely Bounded Norms. IACR Cryptol. ePrint Arch. 2022: 225 (2022) - 2021
- Jalaj Upadhyay, Sarvagya Upadhyay, Raman Arora:
Differentially Private Analysis on Graph Streams. AISTATS 2021: 1171-1179 - Jalaj Upadhyay, Sarvagya Upadhyay:
A Framework for Private Matrix Analysis in Sliding Window Model. ICML 2021: 10465-10475 - 2020
- Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou:
Near Optimal Linear Algebra in the Online and Sliding Window Models. FOCS 2020: 517-528 - Jalaj Upadhyay, Sarvagya Upadhyay:
A Framework for Private Matrix Analysis. CoRR abs/2009.02668 (2020) - 2019
- Jalaj Upadhyay:
Sublinear Space Private Algorithms Under the Sliding Window Model. ICML 2019: 6363-6372 - Raman Arora, Jalaj Upadhyay:
On Differentially Private Graph Sparsification and Applications. NeurIPS 2019: 13378-13389 - 2018
- Maura B. Paterson
, Douglas R. Stinson, Jalaj Upadhyay:
Multi-prover proof of retrievability. J. Math. Cryptol. 12(4): 203-220 (2018) - Raman Arora, Vladimir Braverman, Jalaj Upadhyay:
Differentially Private Robust Low-Rank Approximation. NeurIPS 2018: 4141-4149 - Jalaj Upadhyay:
The Price of Privacy for Low-rank Factorization. NeurIPS 2018: 4180-4191 - Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou:
Near Optimal Linear Algebra in the Online and Sliding Window Models. CoRR abs/1805.03765 (2018) - 2017
- Adam D. Smith, Abhradeep Thakurta, Jalaj Upadhyay:
Is Interaction Necessary for Distributed Private Learning? IEEE Symposium on Security and Privacy 2017: 58-77 - 2016
- Jalaj Upadhyay:
Review of: Distributed Computing Through Combinatorial Topology by Maurice Herlihy and Dmitry Kozlov and Sergio Rajsbaum. SIGACT News 47(2): 18-20 (2016)
skipping 19 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 02:50 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint