Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. - Ho-Lin Chen; David Doty; Dhiraj Holden; Chris Thachuk; Damien Woods; Chun-Tao Yang (DNA, 2014)

On SZK and PP. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2016)

On the Fine Grained Complexity of Polynomial Time Problems Given Correlated Instances. - Shafi Goldwasser; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2016)

The Complexity of Problems in P Given Correlated Instances. - Shafi Goldwasser; Dhiraj Holden (ITCS, 2017)

The Minimum Oracle Circuit Size Problem. - Eric Allender; Dhiraj Holden; Valentine Kabanets (Comput. Complex., 2017)

A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems. - Dhiraj Holden (CoRR, 2017)

Pseudo-Deterministic Proofs. - Shafi Goldwasser; Ofer Grossman; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2017)

No-Signaling Proofs with O(√(log n)) Provers are in PSPACE. - Dhiraj Holden; Yael Kalai (CoRR, 2019)

Doubly-Efficient Pseudo-Deterministic Proofs. - Michel X. Goemans; Shafi Goldwasser; Dhiraj Holden (Electron. Colloquium Comput. Complex., 2019)

Non-signaling proofs with o(√ log n) provers are in PSPACE. - Dhiraj Holden; Yael Tauman Kalai (STOC, 2020)

On the Power of Statistical Zero Knowledge. - Adam Bouland; Lijie Chen 001; Dhiraj Holden; Justin Thaler; Prashant Nalini Vasudevan (SIAM J. Comput., 2020)

Modern Interactive Proofs. - Dhiraj Holden (2022)