TCS+ Talk: Omer Reingold

preview_player
Показать описание
Constant Round Interactive Proofs for Delegating Computation
  1. TCS+
Рекомендации по теме
TCS+ Talk: Omer 1:14:09

TCS+ Talk: Omer Reingold

TCS+ talk: Ronitt 1:11:19

TCS+ talk: Ronitt Rubinfeld

TCS+ Talk: Michael 1:10:12

TCS+ Talk: Michael P. Kim

TCS+ talk: Aaron 1:06:45

TCS+ talk: Aaron Roth

TCS+ Talk: Stephen 1:02:22

TCS+ Talk: Stephen Fenner

TCS+ talk: Ola 1:05:48

TCS+ talk: Ola Svensson

TCS+ talk: Tali 1:14:28

TCS+ talk: Tali Kaufman

Eitan Bachmat 0:47:01

Eitan Bachmat

TCS+ talk: Moses 1:02:57

TCS+ talk: Moses Charikar

A Complexity-Theoretic Perspective 0:11:50

A Complexity-Theoretic Perspective on Fairness

TCS+ talk: Nima 1:06:44

TCS+ talk: Nima Anari

TCS+ talk: Swastik 1:12:33

TCS+ talk: Swastik Kopparty

TCS+ talk: Michael 1:14:06

TCS+ talk: Michael Kearns

TCS+ talk: Shubhangi 1:15:47

TCS+ talk: Shubhangi Saraf (2014/02/12)

TCS+ talk: Virginia 1:28:15

TCS+ talk: Virginia Vassilevska Williams

Yael Tauman Kalai 1:04:10

Yael Tauman Kalai @ Theory Lunch