DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Steven Rudich
Steven Rudich
Adaptive Garbled RAM from Laconic Oblivious Transfer
Securely Obfuscating Re-Encryption
Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds
Statistical Queries and Statistical Algorithms: Foundations and Applications∗
Download This PDF File
View This Volume's Front and Back Matter
ERIC W. ALLENDER Department of Computer Science
Manuel Blum's CV
P Versus NP Problem 1 P Versus NP Problem
Towards an Algebraic Natural Proofs Barrier Via Polynomial Identity Testing
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower
Program of the Thirty-Second Annual ACM Symposium on Theory of Computing
Salil P. Vadhan
Salil P. Vadhan
Sponsored by IEEE Computer Society Technical Committee On
Black-Box Separations for Differentially Private Protocols
Research Statement
The Journey from NP to TFNP Hardness
Top View
Expander-Based Cryptography Meets Natural Proofs
Novel Frameworks for Mining Heterogeneous and Dynamic
Natural Proofs
The Sample Complexity of Parity Learning in the Robust Shuffle Model
Chicago Journal of Theoretical Computer Science MIT Press
Towards an Algebraic Natural Proofs Barrier Via Polynomial Identity Testing
On Statistically Secure Obfuscation with Approximate Correctness
The P Versus NP Problem
FOCS '94 the 35Thannual IEEE Conference on Foundations Of
Sublinear-Time Adaptive Data Analysis
Structure Vs Combinatorics in Computational Complexity∗
DIMACS Research and Education Institute (DREI '97) Cryptography
John Von Neumann
Salil P. Vadhan
Comparing Information Without Leaking It
Structure Vs Combinatorics in Computational Complexity∗
The Computational Complexity Column by Vikraman Arvind Institute of Mathematical Sciences, CIT Campus, Taramani Chennai 600113, India