Research Statement Salil Vadhan September[removed]

First Page		Document Content
Date: 2009-08-20 14:10:08 Probabilistic complexity theory Cryptographic protocols Computational complexity theory Randomness Complexity classes Salil Vadhan Zero-knowledge proof Probabilistically checkable proof Pseudorandomness Theoretical computer science Applied mathematics Cryptography		Research Statement Salil Vadhan September[removed] Add to Reading List Source URL: people.seas.harvard.edu Download Document from Source Website File Size: 155,59 KB Share Document on Facebook

	Lecture Notes on Pseudorandomness { Part I Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. email: DocID: 1v2G7 - View Document
	Pseudorandomness for Network Algorithms Russell Impagliazzo ∗ Noam Nisan DocID: 1unPp - View Document
	Contents Pseudorandomness { Part II Introduction Lecture 1. Deterministic Simulation of Randomized Algorithms 1. Probabilistic Algorithms versus Deterministic Algorithms 2. De-randomization Under Complexity Assumptions DocID: 1ukkf - View Document
	Pseudorandomness Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. March 27, 2000 DocID: 1udL1 - View Document
	Pseudorandomness Thursday, September 21, :11 PM 2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824 DocID: 1tDzT - View Document