Profile of Luca Trevisan, the Simons Institute's Incoming Senior Scientist

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=0x7jPANCgAk


Duration: 14:14
2,882 views
25

The Simons Institute is pleased to announce the appointment of Luca Trevisan as our first permanent Senior Scientist. Luca rejoined UC Berkeley this fall, with joint appointments at the Simons Institute and Department of Electrical Engineering and Computer Sciences, and the Department of Mathematics. He comes to us most recently from Stanford University, where he was a Professor of Computer Science. He has also held posts at Columbia University, MIT and DIMACS, and earned his Ph.D. from the Sapienza University of Rome, under Pierluigi Crescenzi.

This video introduction features Luca in conversation with Interim Senior Scientist, Christos Papdimitriou.

View a full transcript of the interview: http://simons.berkeley.edu/news/profile-luca-trevisan



Other Videos By Simons Institute for the Theory of Computing


2014-10-21Degree of Central Curve in Quadratic Programming
2014-10-21Matrix Completion for the Independence Model
2014-10-21Mixed Volume Computation in (another) Mixed Volume Time
2014-10-21Chordal Structure and Polynomial Systems
2014-10-21Some Results and Questions as to the Complexity of the (Eigenvalue, Eigenvector) Problem
2014-10-21Real Algebraic Geometry in Computational Game Theory
2014-10-21On the Complexity of Solving Bivariate Systems
2014-10-21Sign Conditions for Injectivity of Generalized Polynomial Maps with Applications to Chemical ...
2014-10-21Descartes' Rule of Signs for Polynomial Systems Supported on Circuits
2014-10-21Solvability of Systems of Polynomial Equations over Finite Fields
2014-10-20Profile of Luca Trevisan, the Simons Institute's Incoming Senior Scientist
2014-10-07The Revolution in Graph Theoretic Optimization
2014-09-29Serialrank: Spectral Ranking using Seriation
2014-09-29Convex Optimization and Quantum Information
2014-09-29Faster SDP Hierarchy Solvers for Local Rounding Algorithms
2014-09-29Tensor Decompositions: Uniqueness and Smoothed Analysis
2014-09-29Convex Relaxations for Recovering Simultaneously Structured Objects
2014-09-29An SDP-based Algorithmic Cheeger Inequality for Vertex Expansion
2014-09-29Spectral Bounds and SDP Hierarchies for Geometric Packing Problems
2014-09-29A Polynomial Time Algorithm for Lossy Population Recovery
2014-09-29Learning Overcomplete Latent Variable Models through Tensor Power Method


Tags:
Simons Institute
Computer Science
Theory Of Computation (Field Of Study)
UC Berkeley
Luca Trevisan