Citation:
Vadhan, Salil. “The complexity of counting in sparse, regular, and planar graphs.” SIAM Journal on Computing 31, no. 2 (2001): 398-427.
Vicky Joseph Professor of Computer Science and Applied Mathematics
This portion of the site is new and papers are still being added.
For a more complete list of my publications, please see my former site, Digital Access to Scholarship at Harvard (DASH), the DBLP Computer Science Bibliography, the Privacy Tools Project, and/or my CV.