Adam Klivans

I am an assistant 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).

PC Co-Chair: COLT 2009, in Montreal. The submission deadline is Feb. 13, 2009. Postdoctoral Positions for 2009-2010 academic year. Editorial Board: Theory of Computing and Machine Learning Journal. Recent Program Committees: FOCS 2007, ECML 2008, RANDOM 2008, SODA 2009. Teaching: Analysis of Programs-- Honors (336H), Spring 2009. Computational Learning Theory, Fall 2008. The Computational Complexity of Machine Learning, Spring 2005. (Former) Postdoc: Parikshit Gopalan. Student: Alexander Sherstov. Some Publications Research Interests: Machine Learning, Derandomization, Randomized Algorithms, Computational Complexity, Cryptography, Extremal Combinatorics. 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