Adam Klivans

I am an Associate Professor in the Computer Science Department of the University of Texas at Austin. During the Fall 2004 semester I visited the Toyota Technological Institute. Before that I was an NSF Mathematical Sciences Postdoctoral Fellow at Harvard under Leslie Valiant. I received my PhD from MIT in 2002 (advisor: Dan Spielman).

NEW COURSE FOR 2012: CS313k Mathematical Tools for Computer Science, Spring 2012. PUBLICATIONS Research Professor, MSRI Workshop on Quantitative Geometry, Berkeley 2011. PC Co-Chair: COLT 2009, in Montreal. Editorial Board: Theory of Computing and Machine Learning Journal. Recent Program Committees: FOCS 2007, RANDOM 2008, SODA 2009, COLT 2011, ITCS 2012, FOCS 2012. Teaching: Analysis of Programs-- Honors (336H), Spring 2010. The Computational Complexity of Machine Learning, Spring 2005. Postdoc: Homin Lee. (Former) Postdoc: Parikshit Gopalan. (Former) Student: Alexander Sherstov. Research Interests: Learning Theory, Computational Complexity, Pseudorandomness, Limit Theorems, and Gaussian Space. Support Research supported by an NSF CAREER Award (The Computational Complexity of Halfspace-Based Learning), NSF Grant CCF-0728536 (The Computational Intractability of Machine Learning Tasks), and a Texas Advanced Research Program Award. How to reach me: E-mail: klivans@cs *dot* utexas *dot* edu The University of Texas at Austin Department of Computer Science Taylor Hall 2.124 1 University Station, C0500 Austin, TX 78712-1188