Dhiraj Holden is a graduate student studying theoretical computer science, specifically, aspects relating to computational complexity. His prior work has examined the properties of different models of computation, which included oracle circuits, correlated instances, and pseudo-determinism. Currently, Dhiraj is studying proofs of proximity and program checking.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Graduate Student.