default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarvagya Upadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. SODA 2024: 995-1018- 2023
- [c8]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. SODA 2023: 5003-5039 - [i7]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
A Unifying Framework for Differentially Private Sums under Continual Observation. CoRR abs/2307.08970 (2023) - 2022
- [j8]Xiaoyuan Liu
, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, Arnab Roy:
Leveraging special-purpose hardware for local search heuristics. Comput. Optim. Appl. 82(1): 1-29 (2022) - [i6]Monika Henzinger, Jalaj Upadhyay, Sarvagya Upadhyay:
Almost Tight Error Bounds on Differentially Private Continual Counting. CoRR abs/2211.05006 (2022) - 2021
- [j7]Sarvagya Upadhyay:
Review of Algorithmic Aspects of Machine Learning By Ankur Moitra. SIGACT News 52(1): 9-11 (2021) - [c7]Jalaj Upadhyay, Sarvagya Upadhyay, Raman Arora:
Differentially Private Analysis on Graph Streams. AISTATS 2021: 1171-1179 - [c6]Jalaj Upadhyay, Sarvagya Upadhyay:
A Framework for Private Matrix Analysis in Sliding Window Model. ICML 2021: 10465-10475 - 2020
- [j6]Sarvagya Upadhyay:
Review of Introduction To Property Testing by Oded Goldreich. SIGACT News 51(4): 6-10 (2020) - [c5]Avradip Mandal, Arnab Roy, Sarvagya Upadhyay, Hayato Ushijima-Mwesigwa:
Compressed quadratization of higher order binary optimization problems. CF 2020: 126-131 - [c4]Avradip Mandal, Arnab Roy, Sarvagya Upadhyay, Hayato Ushijima-Mwesigwa:
Compressed Quadratization of Higher Order Binary Optimization Problems. DCC 2020: 383 - [i5]Avradip Mandal, Arnab Roy, Sarvagya Upadhyay, Hayato Ushijima-Mwesigwa:
Compressed Quadratization of Higher Order Binary Optimization Problems. CoRR abs/2001.00658 (2020) - [i4]Jalaj Upadhyay, Sarvagya Upadhyay:
A Framework for Private Matrix Analysis. CoRR abs/2009.02668 (2020)
2010 – 2019
- 2019
- [i3]Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, Arnab Roy:
On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware. CoRR abs/1911.09810 (2019) - 2013
- [j5]Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay:
QMA variants with polynomially many provers. Quantum Inf. Comput. 13(1-2): 135-157 (2013) - 2011
- [j4]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. J. ACM 58(6): 30:1-30:27 (2011) - [i2]Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay:
QMA variants with polynomially many provers. CoRR abs/1108.0617 (2011) - 2010
- [j3]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) - [j2]Sarvagya Upadhyay:
Review of concurrent zero-knowledge by Alon Rosen Springer-Verlag, 2006. SIGACT News 41(4): 38-42 (2010) - [c3]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. STOC 2010: 573-582
2000 – 2009
- 2009
- [c2]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS 2009: 534-543 - [i1]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-message quantum interactive proofs are in PSPACE. CoRR abs/0905.1300 (2009) - 2008
- [j1]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. 17(2): 282-299 (2008) - 2007
- [c1]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC 2007: 109-114
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-24 22:51 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:
