Piyush Srivastava
पीयूष श्रीवास्तव
I recently submitted my
my dissertation at UC Berkeley.
In September 2014, I will be starting as a postdoc at
the Center
for the Mathematics of Information at Caltech.
I am broadly interested in randomized algorithms (and
especially in connections between phase transitions and
approximate counting). My research advisor at UC Berkeley
was 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.
 Comm. Math. Phys. 329 (3),
pp. 827858. August 2014.
 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
 J. Comp. Biol. 19 (10), pp. 11761202,
October 2012.

Alistair
Sinclair, Piyush Srivastava,
and Marc
Thurley. Approximation algorithms for twostate
antiferromagnetic spin systems.
 J. Stat. Phys. 155 (4),
pp. 666686. March 2014.
 Extended abstract in the proceedings of the ACMSIAM
Symposium on Discrete Algorithms (SODA), 2012.
 [arXiv
version].
Dissertation
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.