Allan Sly received his PhD in statistics from UC Berkeley and was a postdoc in the theory group at Microsoft Research, Redmond. His research focuses on random processes on networks, particularly at the intersection of probability, theoretical computer science and statistical physics. He had received a Sloan Fellowship, NSF Career Award, Rollo Davidson Prize and best paper awards at FOCS and COLT.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Scientist, Program Organizer and Workshop Organizer.