Teaching and Advising

[Back to Adam Smith's home page.]

Courses

Spring 2012: (CMPSC 465) Introduction to Algorithms
Fall 2011: (CSE 598D) Pseudorandomness
Spring 2011: (CSE 546) Cryptography
Fall 2010: (CSE 565) Algorithm Design and Analysis
Spring 2010: Algorithmic Aspects of Data Privacy
Fall 2009: (CMPSC 465) Introduction to Algorithms
Spring 2009: (CSE 546) Cryptography.
Fall 2008: (CSE 565) Algorithm Design and Analysis
Spring 2008: Theoretical CS seminar
Fall 2007:
- Introduction to Cryptography
- Data Privacy
Spring 2007: CSE 465: Introduction to Algorithms
Spring 2005:Short course on database privacy at Weizmann.

Students

Current:

Abhradeep Guha Thakurta, Ph.D. expected 2013.
Megan Heysham, Ph.D. expected 2015.
Ye Zhang, Ph.D. expected 2015.

Former:

Laxman Vembar, M.S. 2008.
Ashwinkumar Gopalrathnam, M.S. (Electrical Engineering) 2008.
S. Ranjit Ganta, Ph.D. 2008 (co-advised with Raj Acharya).

Graduate applicants

If you are interested in the CSE graduate program, please look at http://www.cse.psu.edu/academics/graduate/ for information on admission and a description of the program. Research assistantships are available for strong candidates interested in working in cryptography and theory. Make sure to indicate my name, "cryptography" or "theoretical computer science" prominently in your application if you want our group to consider you. Our department receives many applications, and I cannot review all of them personally.

Last modified: Fri Feb 3 22:39:38 EST 2012
Adam Smith