I am a fourth year graduate student in computer science at UC
Berkeley, where my research advisor
Sinclair. I am broadly interested in randomized
algorithms (and especially in connections between statistical
physics and approximate counting).
Before coming to Berkeley, I did my undergraduate studies
in computer science
at IIT Kanpur.
Email: piyushsr (at) cs (dot) berkeley (dot) edu.
Sinclair, Piyush Srivastava. Lee-Yang theorems and the
complexity of computing
averages. Extended abstract to appear in STOC 2013. [arXiv
M. Dixit, Piyush Srivastava
K. Vishnoi. A finite population model of Molecular
Evolution. Journal of Computational
Biology 19 (10), pp. 1176-1202, October 2012.
Sinclair, Piyush Srivastava,
Thurley. Approximation algorithms for two-state
anti-ferromagnetic spin systems. SODA
- CS172: Computability and Complexity (Spring 2012, UC Berkeley).