Piyush Srivastava
पीयूष श्रीवास्तव
I am a graduate student in computer science at UC
Berkeley. I am broadly interested in randomized
algorithms (and especially in connections between phase
transitions and approximate counting). My research advisor
is Alistair
Sinclair.
Before coming to Berkeley, I did my undergraduate studies
in computer science
at IIT Kanpur.
Email: piyushsr (at) cs (dot) berkeley (dot) edu.
CV.
Papers

Alistair
Sinclair, Piyush Srivastava,
and Yitong
Yin. Spatial mixing and approximation algorithms for
graphs with bounded connective constant.
 Extended abstract in the proceedings of the
IEEE Symposium on the Foundations of Computer Science
(FOCS), 2013.
 [arXiv
version].

Alistair
Sinclair, Piyush Srivastava. LeeYang theorems and the
complexity of computing averages.
 Full version to appear in Communications in
Mathematical Physics.
 Extended abstract in the proceedings of the ACM
Symposium on the Theory of Computing (STOC), 2013.
 [arXiv
version].

Narendra
M. Dixit, Piyush Srivastava
and Nisheeth
K. Vishnoi. A finite population model of Molecular
Evolution.
 Journal of Computational
Biology 19 (10), pp. 11761202,
October 2012.

Alistair
Sinclair, Piyush Srivastava,
and Marc
Thurley. Approximation algorithms for twostate
antiferromagnetic spin systems.
 Extended abstract in the proceedings of the ACMSIAM
Symposium on Discrete Algorithms (SODA), 2012.
 [arXiv
version].
Notes
 The LeeYang Theory of Phase
Transitions.
Older Manuscripts
Teaching
 CS170: Efficient Algorithms and Intractable Problems (Fall 2013,
UC Berkeley). Instructor: Satish Rao.
 CS172: Computability and Complexity (Spring 2012, UC
Berkeley). Instructor: Koushik
Sen.