## Overview of Univalent Foundations

Vladimir Voevodsky

Institute for Advanced Study

September 27, 2012

(Continued from September 26, 2012)

Vladimir Voevodsky

Institute for Advanced Study

September 27, 2012

(Continued from September 26, 2012)

Andrew Drucker

Massachusetts Institute of Technology; Member, School of Mathematics

September 27, 2012

Klim Efremenko

Tel-Aviv University; Member, School of Mathematics

September 27, 2012

A code C is said to be Locally Decodable Code with q queries if it is possible to recover any symbol x_j of a message x by making at most q queries to C(x), such that even if a constant fraction of C(x) is corrupted, the decoding algorithm returns the correct answer with high probability.

Eric Finster

Ecole Polytechnique Federal de Lausanne; Member, School of Mathematics

September 27, 2012

Radhika Ganapathy

Purdue University; Member, School of Mathematics

September 27, 2012

David Geraghty

Princeton University/Institute for Advanced Study

September 27, 2012

Wushi Goldring

Universite Paris 13; Member, School of Mathematics

September 27, 2012

Doris Hein

University of California, Santa Cruz; Member, School of Mathematics

September 28, 2012

Yi Hu

University of Illinois at Urbana-Champaign; Member, School of Mathematics

September 28, 2012

Hao Huang

University of California, Los Angeles; Member, School of Mathematics

September 28, 2012