default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDhiraj Holden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[b1]Dhiraj Holden:
Modern Interactive Proofs. Massachusetts Institute of Technology, USA, 2022- 2020
- [j2]Adam Bouland
, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49(4) (2020) - [c6]Dhiraj Holden, Yael Tauman Kalai:
Non-signaling proofs with o(√ log n) provers are in PSPACE. STOC 2020: 1024-1037
2010 – 2019
- 2019
- [i11]Michel X. Goemans, Shafi Goldwasser, Dhiraj Holden:
Doubly-Efficient Pseudo-Deterministic Proofs. CoRR abs/1910.00994 (2019) - [i10]Dhiraj Holden, Yael Kalai:
No-Signaling Proofs with O(√(log n)) Provers are in PSPACE. CoRR abs/1910.02590 (2019) - [i9]Michel X. Goemans, Shafi Goldwasser, Dhiraj Holden:
Doubly-Efficient Pseudo-Deterministic Proofs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c5]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-Deterministic Proofs. ITCS 2018: 17:1-17:18 - 2017
- [j1]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. Comput. Complex. 26(2): 469-496 (2017) - [c4]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. FOCS 2017: 708-719 - [c3]Shafi Goldwasser, Dhiraj Holden:
The Complexity of Problems in P Given Correlated Instances. ITCS 2017: 13:1-13:19 - [i8]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-deterministic Proofs. CoRR abs/1706.04641 (2017) - [i7]Dhiraj Holden:
A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems. CoRR abs/1707.05808 (2017) - [i6]Shafi Goldwasser, Ofer Grossman, Dhiraj Holden:
Pseudo-Deterministic Proofs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i5]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. CoRR abs/1609.02888 (2016) - [i4]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Shafi Goldwasser, Dhiraj Holden:
On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c2]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. STACS 2015: 21-33 - 2014
- [c1]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. DNA 2014: 20-36 - [i2]Ho-Lin Chen, David Doty, Dhiraj Holden, Chris Thachuk, Damien Woods, Chun-Tao Yang:
Fast algorithmic self-assembly of simple shapes using random agitation. CoRR abs/1409.4828 (2014) - [i1]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. Electron. Colloquium Comput. Complex. TR14 (2014)
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:
