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.
PODC 2007 © 2007 IBM Corporation Constructing Scalable Overlays for Pub/Sub With Many Topics Problems, Algorithms, and Evaluation G. Chockler, R. Melamed,
Dana Moshkovitz. Back to NP L NP iff members have short, efficiently checkable, certificates of membership. Is satisfiable? x 1 = truex 11 = true.
Complexity 1 coNP Having Proofs for Incorrectness.
Minimum Maximum Degree Publish-Subscribe Overlay Network Design Melih Onus TOBB Ekonomi ve Teknoloji Üniversitesi, 28 Mayıs 2009.
Interactive Protocols
Derandomization & Cryptography
Uniform Hardness vs. Randomness Tradeoffs for Arthur-Merlin Games.
April 14, 2009, Arizona State University Committee: Andrea W. Richa (Chair) Goran Konjevod Rida Bazzi Christian Scheideler Overlay Network Construction.
