Luca Trevisan — LLMpedia

Luca Trevisan
Name	Luca Trevisan
Birth date	1971
Birth place	Milan, Italy
Fields	Computer science, Theoretical computer science, Algorithms, Complexity theory
Alma mater	Scuola Normale Superiore di Pisa, University of Rome Tor Vergata
Doctoral advisor	Silvio Micali
Known for	Approximation algorithms, Expander graphs, Probabilistically checkable proofs, Randomness extractors

Contents

Luca Trevisan is an Italian theoretical computer scientist known for contributions to algorithms, computational complexity theory, and probabilistic methods in computer science. He has held faculty positions in major research institutions and has influenced work on approximation algorithms, expander graphs, and the theory of randomness extractors. His research intersects with topics studied at conferences such as the ACM Symposium on Theory of Computing, IEEE FOCS, and workshops organized by institutions like the Institute for Advanced Study and Simons Institute for the Theory of Computing.

Early life and education

Born in Milan, Italy, he studied at Italian institutions including Scuola Normale Superiore di Pisa and pursued graduate work under the supervision of Silvio Micali at institutions connected to University of Rome Tor Vergata and research environments associated with Massachusetts Institute of Technology influences. His formative training connected him with traditions from Italian Institute of Technology research and the European theoretical community involved with events like the International Congress of Mathematicians and meetings at École Normale Supérieure. During this period he interacted with researchers linked to Princeton University, Stanford University, and the University of California, Berkeley through seminars and collaborative visits.

He has held faculty and research positions at universities and research centers in North America and Europe, engaging with departments such as Stanford University's and programs at University of California, Berkeley and visiting roles at the Institute for Advanced Study. His career includes membership in faculty groups that collaborate with labs like Microsoft Research and partnerships with projects at the Simons Institute for the Theory of Computing and the Royal Society visiting researcher schemes. He has taught courses related to topics presented at conferences including ACM STOC and IEEE FOCS and served on program committees for meetings at SIAM and workshops organized by European Research Council grantees.

His work has advanced understanding in multiple areas: approximation algorithms and hardness of approximation connected to the Probabilistically Checkable Proofs framework and the Unique Games Conjecture discussions; structural properties of expander graphs and spectral graph theory linked to results used in error-correcting codes and pseudorandomness constructions; development of randomness extractors and seeded extractor paradigms relevant to cryptography communities such as those around RSA Conference topics and researchers at IACR events; and algorithmic complexity results informing reductions used in studies at ACM Symposium on Principles of Database Systems and SIAM Symposium on Discrete Algorithms. His collaborations and citations connect him to figures at MIT, Princeton University, Harvard University, and research teams at Google Research. Contributions include techniques comparable to work by Subhash Khot, Avi Wigderson, Madhu Sudan, Avi Ben-Or, and Shafi Goldwasser.

He has been recognized by academic societies and award committees associated with prizes awarded at conferences like ACM STOC and honors paralleling fellowships from organizations such as the Guggenheim Foundation, Simons Foundation, and national science bodies including National Science Foundation collaborations. His distinctions align with lists of invited lecturers at events like the International Colloquium on Automata, Languages and Programming and invited talks at the Royal Society and the National Academy of Sciences-affiliated symposia. He has been cited in connection with recipient lists for research awards issued by institutions like IEEE and ACM.

- Papers on approximation hardness and reductions appearing in proceedings of ACM STOC and IEEE FOCS alongside contemporaries such as Subhash Khot and Uriel Feige. - Work on extractors and pseudorandomness published in venues associated with SIAM Journal on Computing and proceedings of the IEEE Symposium on Foundations of Computer Science. - Articles on spectral methods and expander constructions referenced in collections from Proceedings of the National Academy of Sciences and compiled volumes tied to Institute of Electrical and Electronics Engineers publications. - Contributions to surveys and pedagogical materials used in graduate courses at Stanford University, MIT, and UC Berkeley and chapters in handbooks edited by contributors from Cambridge University Press and Springer.

Outside research he has engaged with public outreach and academic service connected to organizations such as European Research Council panels, invited outreach at institutions like Scuola Normale Superiore di Pisa and public lectures tied to science festivals in cities including Milan and Pisa. He has participated in mentoring initiatives associated with programs run by Simons Foundation, National Science Foundation, and university outreach offices at Princeton University and Stanford University to promote pipeline development for students from diverse backgrounds.