On the power of statistical zero knowledge A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
43 2019 Characterization of BshA, bacillithiol glycosyltransferase from Staphylococcus aureus and Bacillus subtilis H Upton, GL Newton, M Gushiken, K Lo, D Holden, RC Fahey, M Rawat
FEBS letters 586 (7), 1004-1008, 2012
29 2012 The minimum oracle circuit size problem E Allender, D Holden, V Kabanets
Computational Complexity 26, 469-496, 2017
28 2017 Pseudo-deterministic proofs S Goldwasser, O Grossman, D Holden
arXiv preprint arXiv:1706.04641, 2017
27 2017 The minimum oracle circuit size problem E Allender, D Holden, V Kabanets
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
21 2015 Fast algorithmic self-assembly of simple shapes using random agitation HL Chen, D Doty, D Holden, C Thachuk, D Woods, CT Yang
DNA Computing and Molecular Programming: 20th International Conference, DNA …, 2014
20 2014 A note on unconditional subexponential-time pseudo-deterministic algorithms for BPP search problems D Holden
arXiv preprint arXiv:1707.05808, 2017
11 2017 The complexity of problems in p given correlated instances S Goldwasser, D Holden
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
7 2017 Doubly-efficient pseudo-deterministic proofs M Goemans, S Goldwasser, D Holden
arXiv preprint arXiv:1910.00994, 2019
6 2019 On szk and pp A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
arXiv preprint arXiv:1609.02888, 2016
4 2016 Non-signaling proofs with o (√ log n) provers are in PSPACE D Holden, YT Kalai
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
3 2020 On the fine grained complexity of polynomial time problems given correlated instances S Goldwasser, D Holden
Innovations in Theoretical Computer Science (ITCS), 2016
3 2016 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
2 2017 Results on the 3x+ 1 and 3x+ d conjectures D HOLDEN
Dhiraj. pdf, 0
1 Modern Interactive Proofs D Holden
Massachusetts Institute of Technology, 2022
2022 Non-Signaling Proofs with Provers are in PSPACE D Holden, Y Kalai
arXiv preprint arXiv:1910.02590, 2019
2019 Solving problems in P using correlated instances D Holden
Massachusetts Institute of Technology, 2017
2017 1 Grothendieck’s Inequality AM Scribe, D Holden