Low-End Uniform Hardness vs. Randomness Tradeoffs for Arthur-Merlin Games. Ronen Shaltiel, University of Haifa Chris Umans, Caltech.
Derandomization & Cryptography Boaz Barak, Weizmann Shien Jin Ong, MIT Salil Vadhan, Harvard.
Uniform Hardness vs. Randomness Tradeoffs for Arthur-Merlin Games. Danny Gutfreund, Hebrew U. Ronen Shaltiel, Weizmann Inst. Amnon Ta-Shma, Tel-Aviv U.
01 THE emotional DOMAIN Justin Magee, Senior Lecturer DES307M1.
COUNTEREXAMPLES to Hardness Amplification beyond negligible
THE emotional DOMAIN
Derandomization & Cryptography
Uniform Hardness vs. Randomness Tradeoffs for Arthur-Merlin Games.
1 Explicit Two-Source Extractors and Resilient Functions Eshan Chattopadhyay David Zuckerman UT Austin.
The Complexity of Pebbling Graphs and Spam Fighting Moni Naor WEIZMANN INSTITUTE OF SCIENCE.
Computer Architecture in the 21 st Century Chuck Thacker Microsoft Research Silicon Valley January, 2013.