DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Tim Roughgarden
Tim Roughgarden
The Next Digital Decade Essays on the Future of the Internet
The Flajolet-Martin Sketch Itself Preserves Differential Privacy: Private Counting with Minimal Space
Hardness of Non-Interactive Differential Privacy from One-Way
Communication Complexity (For Algorithm Designers)
An Axiomatic Approach to Block Rewards
Fall 2016 Dear Computer Science Alumni and Friends, These Are
Letter from the President
A Revisionist History of Algorithmic Game Theory
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE
Generalization in Adaptive Data Analysis and Holdout Reuse
Computer Science and Game Theory
CS364A: Algorithmic Game Theory Lecture #1: Introduction and Examples∗
Stronger Bounds on Braess's Paradox And
Expander Codes
On Adaptive Distance Estimation
Arxiv:1311.2828V3 [Cs.GT] 19 Aug 2016 † Department of Computer and Information Science, University of Pennsylvania
Indistinguishability Obfuscation from Well-Founded Assumptions
SIGACT Viability
Top View
Algorithmic Game Theory - Handout2
Arxiv:1703.10069V1 [Cs.AI] 29 Mar 2017 Which Is Otherwise Unthinkable by a Single Person
Patterns, Predictions, and Actions
Lipics-ITCS-2018-0.Pdf (0.4
Bibliography
Sloan Privacy Bibliography
Game Theory, Alive Anna R
Interactive Proofs of Proximity: Delegating Computation in Sublinear Time
Download This PDF File
On the Concrete Hardness of Learning with Errors
Transaction Fee Mechanism Design for the Ethereum Blockchain: an Economic Analysis of EIP-1559∗
Improving Sparse Vector Technique with Renyi Differential Privacy
Identity-Based Encryption from the Diffie-Hellman Assumption⋆
Barriers to Near-Optimal Equilibria
Characterizing Truthfulness in Discrete Domains
The Limits of Two-Party Differential Privacy
Structural Econometrics of Auctions: a Review
Lipics-ITCS-2019-0.Pdf (0.4
Tim Roughgarden Curriculum Vitae
The Impossibility of Obfuscation with a Universal Simulator
The Big Picture
Salil P. Vadhan
Michal Feldman
Contents U U U
Complexity Theory, Game Theory, and Economics: the Barbados Lectures Full Text Available At
White Box Traitor Tracing
Mathematics and Computation
Academic Member Highlight Book Fall 2017
New Algorithms for Preserving Differential Privacy Aaron Roth CMU-CS-10-135 July 2010
STOC 2005 Program Committee Selected Two Award Papers
Algorithmic Game Theory Jerusalem, May 22Nd-26Th, 2011
2016 – the 2016 Donald E
G¨Odel Prize 2016
Approximation in Algorithmic Game Theory: Robust Approximation Bounds for Equilibria and Auctions
Omri Weinstein Curriculum Vitæ
Call for Papers: 2013 ACM Symposium on Theory of Computing
Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions
Arxiv:1702.02970V1 [Cs.DS] 9 Feb 2017
Structural Econometrics of Auctions: a Review
A Computational Complexity Perspective
An Algorithmic Game Theory Primer∗
December 2007 Table of Contents
Date: April 2021 R E S U M E 1. PERSONAL DETAILS Full Name: Inbal Talgam-Cohen Identity No: 040470825 Phone Numbers: 054-4304650
Selfish Routing
APPROX 2009 and RANDOM 2009
Laconic Function Evaluation and Applications
Submission Data for 2020-2021 CORE Conference Ranking Process International Workshop on Randomization and Computation
A Computational Separation Between Private Learning and Online Learning∗
Association for Computing Machinery 2 Penn Plaza, Suite 701, New York
The Book Review Column1 by William Gasarch Department Of
John Von Neumann
On the Geometry of Two-Party Differentially-Private Protocols
Computing Correlated Equilibria in Multi-Player Games∗
Mechanism Design in Large Games: Incentives and Privacy ∗
Multiparty Non-Interactive Key Exchange and More From
Matching Markets: Design and Analysis