Ran Raz
Professor of Computer Science
Office: 240 194 Nassau St.
Phone: 609-258-2086
Research Interests: Complexity theory, with emphasis on proving lower bounds for computational models: Boolean and arithmetic circuit complexity, communication complexity, interactive proofs and probabilistically checkable proofs, randomness and derandomization, time-space lower bounds for learning.