DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Noam Nisan
Noam Nisan
Going Beyond Dual Execution: MPC for Functions with Efficient Verification
László Lovász Avi Wigderson De L’Université Eötvös Loránd À De L’Institute for Advanced Study De Budapest, En Hongrie Et À Princeton, Aux États-Unis
The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space
6.5 X 11.5 Doublelines.P65
Algorithmic Mechanism Design
Pseudorandomness and Combinatorial Constructions
Specification Faithfulness in Networks with Rational Nodes
László Lovász Avi Wigderson of Eötvös Loránd University of the Institute for Advanced Study, in Budapest, Hungary and Princeton, USA
A Revisionist History of Algorithmic Game Theory
Typically-Correct Derandomization for Small Time and Space William M
List of My Favorite Publications
17Th Knuth Prize: Call for Nominations
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant Error
The Complexity of Differential Privacy
The Complexity of Differential Privacy
Curriculum Vitae Amir Ronen Department of Computer Science, Stanford University and ISCI Berkeley
[email protected]
SIGACT Viability
Open Main.Pdf
Top View
Federated Computing Research Conference, FCRC’96, Which Is David Wise, Steering Being Held May 20 - 28, 1996 at the Philadelphia Downtown Marriott
Algorithmic Game Theory - Handout2
Space Pseudorandom Generators by Communication Complexity Lower Bounds
2020 Knuth Prize Is Awarded to Cynthia Dwork
Algorithmic Mechanism Design
Revision 1 of Report No
Unambiguous Dnfs and Alon–Saks–Seymour Arxiv:2102.08348V2
Download This PDF File
On the Power of Randomization in Algorithmic Mechanism Design
Download and Use Untrusted Code Without Fear
László Lovász Avi Wigderson De La Universidad Eötvös Loránd De Del Instituto De Estudios Avanzados Budapest, Hungría Y De Princeton, EE
Real Analysis in Computer Science: a Collection of Open Problems
Direct Sum Questions in Classical Communication Complexity
For Computer Scientists) Noam Nisan
Pseudorandom Generators for Space-Bounded Computation
Lovász and Wigderson Awarded 2021 Abel Prize
A Biography of Avi Wigderson
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria