Skip to primary content
Skip to secondary content

Calvin Café: The Simons Institute Blog

What's New at the Simons Institute for the Theory of Computing.

Calvin Café: The Simons Institute Blog

Main menu

Tag Archives: Emmanuel Candes

Throwback Thursday: Emmanuel Candes

Posted on February 19, 2015 by Luca Trevisan
Reply

On October 14, 2013, Emmanuel Candès gave this wonderful lecture on the effectiveness of convex programming in data science and in the physical sciences. Slides are here.

Posted in Throwback Thursday | Tagged Emmanuel Candes | Leave a reply

Subscribe to Blog

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Contribute

We invite guest posts on research in theoretical computer science at the Simons Institute and throughout the world. Interested authors should contact Senior Scientist Venkat Guruswami, at venkatg@berkeley.edu.

Recent Posts

  • This blog has sunsetted
  • Theory at the Institute and Beyond, February 2025
  • Theory at the Institute and Beyond, October 2024
  • Remembering Luca Trevisan (1971–2024)
  • Meta-Complexity: A Basic Introduction for the Meta-Perplexed

Recent Comments

  • éricles on Lattice Blog Reduction – Part I: BKZ
  • Luca on Remembering Luca Trevisan (1971–2024)
  • Luffy on Remembering Luca Trevisan (1971–2024)
  • Vikas Kumar on Lattice Blog Reduction – Part I: BKZ
  • Jual Kambing Purwokerto on Theory at the Institute and Beyond, July 2023

Categories

  • Complexity2015
  • Crypto2015
  • General
  • IT2015
  • Summer School
  • Throwback Thursday
  • Workshop

Tags

  • Big Data
  • BKZ
  • Cynthia Dwork
  • Daniele Micciancio
  • Don Knuth
  • Emmanuel Candes
  • Exponential Time Hypothesis
  • fairness
  • Lattice Block Reduction
  • Lattices
  • Neuroscience
  • obfuscation
  • SAT
  • The Art of Computer Programming
  • Login
Proudly powered by WordPress