Symposia | Spring 2013Visions of the Theory of Computing
May 29–31, 2013
Berdahl Auditorium, Stanley Hall, UC Berkeley
Organizers: Richard Karp (UC Berkeley), Christos Papadimitriou (UC Berkeley), Alistair Sinclair (UC Berkeley).
This three-day symposium will bring together distinguished speakers and participants from the Bay Area and all over the world to celebrate both the excitement of fundamental research on the Theory of Computing, and the accomplishments and promise of computational research in effecting progress in other sciences — the two pillars of the Institute's research agenda.
Note: This symposium immediately precedes STOC, which runs June 1–4, 2013 in Palo Alto, California.
Schedule: Click here. (Pending speaker approval)
Travel Information: Click here.
Registration: The registration deadline has now passed. The Symposium is full and we are unable to confirm any additional guests. The talks will be recorded and posted online after-the-fact. Please check this webpage in early-mid June to view the recordings.
Travel Grants for Graduate Students: A limited number of travel grants will be available for current graduate students. To apply, please send an email to simonsevents@berkeley.edu with the subject line "Symposium Travel," your CV, and a short research statement (no more than one page). The deadline is Wednesday, April 24.
Speakers include:
Josh Bloom
(Astrophysicist, UC Berkeley)Specializes in gamma ray bursts, and the use of machine learning to identify them. |
Bernard Chazelle
(Computer scientist, Princeton University)Fundamental work on geometry, randomness, and algorithms as they arise in nature. |
Maria Chudnovsky
(Mathematician, Columbia University)Powerful research in graph theory. |
Shafi Goldwasser
(Computer scientist, MIT)Received the 2012 Turing Award for her innovative exploration of complexity, cryptography, and their interface. |
David Haussler
(Bioinformatician, UC Santa Cruz)A Howard Hughes investigator and a pioneer of the use of learning algorithms in genomics. |
Jeff Hawkins
(Neuroscientist, Numenta)Founder of Palm and Handspring and neuroscience visionary. |
Jon Kleinberg
(Computer scientist, Cornell University)Groundbreaking research on the algorithmic aspects of social networks. |
Daphne Koller
(Computer scientist, Stanford University)MacArthur Fellow, pioneer in probabilistic machine learning, founder of on-line education platform Coursera. |
Marc Mézard
(Physicist, ENS Paris)Fundamental work at the interface between statistical physics and computation. |
S. Muthu Muthukrishnan
(Computer scientist, Rutgers University and Microsoft Research)Innovative work on algorithms for massive data in connection to compressed sensing, databases, and networking. |
Christos Papadimitriou
(Computer scientist, UC Berkeley)Works on algorithms and complexity as they arise in databases, AI, networks, economics, and evolution. |
Judea Pearl
(Computer scientist, UCLA)Received the 2011 Turing Award for his formative contributions in probabilistic reasoning and causality. |
John Preskill
(Physicist, Caltech)Studies cosmology and quantum information, and wins bets with Stephen Hawking. |
Prabhakar Raghavan
(Computer scientist, Google)Influential contributions in randomized algorithms and web search. |
Alvin Roth
(Economist, Stanford University)Received the 2012 Nobel Prize in Economic Sciences for his research in market design and stable discrete allocations. |
Ned Seeman
(Chemist, New York University)Nanoscience visionary, founding president of the International Society for Nanoscale Science, Computation, and Engineering. |
Leslie Valiant
(Computer scientist, Harvard University)Received the 2010 Turing Award. Essential work in complexity, as well as on computational approaches to learning, neuroscience, and evolution. |
Avi Wigderson
(Computer scientist, Institute for Advanced Study, Princeton)Wide-ranging and fundamental contributions to the theory of computation, information, complexity and randomness. |
Questions? Contact Caroline Allum at +1.510.664.9856 or simonsevents@berkeley.edu.
Support is gratefully acknowledged from:
