![]() |
Dana Moshkovitz: Amplification and Derandomization Without Slowdown Tuesday, September 29, 2015 - 4:15pm to 5:15pm Abstract: We show techniques for decreasing the error probability of randomized algorithms and for converting randomized algorithms to deterministic (non-uniform) algorithms. |
![]() |
David Steurer: Lower bounds on the size of semidefinite programming relaxations Tuesday, May 19, 2015 - 4:15pm to 5:15pm Abstract: |
![]() |
Shaddin Dughmi: Algorithmic Bayesian Persuasion Wednesday, May 13, 2015 - 4:00pm to 5:00pm Abstract: |
![]() |
Elad Hazan: Is Optimization Computationally Equivalent to Online Learning? Tuesday, May 12, 2015 - 4:15pm to 5:15pm Abstract: |
![]() |
Nir Bitansky: On the Cryptographic Hardness of Finding a Nash Equilibrium Tuesday, April 14, 2015 - 4:15pm to 5:15pm Abstract: |
![]() |
Antoine Joux: A Simplified Setting for Discrete Logarithms in Small Characteristics Fin Tuesday, April 7, 2015 - 4:00pm to 5:15pm Abstract: The hardness of computing discrete logarithms in finite field has served as a foundation for many public key cryptosystems. In the last two years, tremendous progress have been made in the case of small characteristic finite fields. |
![]() |
Shayan Gharan: Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSP Tuesday, March 3, 2015 - 4:15pm to 5:15pm Abstract: |
![]() |
Vinod Vaikuntanathan: Program Obfuscation from Functional Encryption Tuesday, February 24, 2015 - 4:15pm to 5:15pm Abstract: Indistinguishability obfuscation is a tremendously exciting notion, powerful enough that from it, one can construct most all cryptographic objects. |
![]() |
Robert Kleinberg: Secretary Problems with Non-Uniform Arrival Order Tuesday, February 17, 2015 - 4:15pm to 5:15pm ABSTRACT: |
|
Constantinos Daskalakis: Mechanism Design via Optimal Transport Tuesday, April 28, 2015 - 4:15pm to 5:15pm Abstract: I will present an optimization framework based on optimal transport theory, characterizing the structure of revenue-optimal mechanisms in single-bidder multi |