Csr2011 june15 11_00_sima
Better Pseudorandom Generators from Milder Pseudorandom Restrictions Raghu Meka (IAS) Parikshit Gopalan, Omer Reingold (MSR-SVC) Luca Trevian (Stanford),
Techniques for Time-Space Tradeoff Lower Bounds for Branching Programs: Part II
Counting Algorithms for Knapsack and Related Problems
A Course on Probabilistic Databases
Amplifying lower bounds by means of self-reducibility
Raghu Meka (IAS)
