Pavan Aduri
Associate Professor

Office: 102 Atanasoff Phone: (515) 294-7902 Email: pavan@cs.iastate.edu Homepage: http://www.cs.iastate.edu/~pavan/

Research Areas

Algorithms, Computational Complexity, Theory of Computation

Education

Ph.D.   University at Buffalo (SUNY), Buffalo, NY   2001
M.S.   Indian Institute of Technology, Kanpur, India.   1995
B.S.   Jawaharlal Nehru Technological University, Hyderabad, India.   1993

Current Grants

Collaborative Research: Reseasrch in Complexity Theory. Pavan Aduri. NSF (2008-2010). $103,209.

Representative Publications

Refereed Journal and Conference Publications

L. Fortnow, A. Pavan, S. Sengupta. Proving SAT does not have small circuits with an application to the two queries problem. Journal of Computer System and Sciences. Vol. 74. No. 3. pp. 358--363, 2008.

C. Glasser, A. Pavan, A. Selman, L. Zhang. Splitting NP-Complete Sets. SIAM Journal of Computing. Vol. 37. No. 5. pp. 1517--1535, 2008.

A. Pavan, S. Tirthapura. Range-efficient computation of F_0 over massive data streams. SIAM Journal of Computing. Vol. 37. No. 2. pp. 359--379, 2007.

J. Hitchcock, A. Pavan. Comparing reductions to NP-complete sets. Infromation and Computation. Vol. 205. No. 5. pp. 694--706, 2007.