Video Lectures

Separate tags with a comma.

Locally decodable codes (LDCs) are error-correcting codes that allow for highly-efficient recovery of "pieces" of information even after arbitrary corruption of a codeword. Locally testable codes (LTCs) are those that allow for highly-efficient...

There are two important measures of the complexity of a boolean function: the sensitivity and block sensitivity. Whether or not they are polynomial related remains a major open question. In this talk I will survey some known results on this...

Fix a metric (Riemannian or Finsler) on a compact manifold M. The critical points of the length function on the free loop space LM of M are the closed geodesics on M. Filtration by the length function gives a link between the geometry of closed...