World's Best Scientists 2026 revealed!
Luca Trevisan

Luca Trevisan

Award Badge
Computer Science
Italy
2025

D-Index & Metrics

Computer Science

D-Index
61
Citations
11184
World Ranking
3131
National Ranking
57

Research.com Recognitions

  • 2025 - Research.com Computer Science in Italy Leader Award
  • 2023 - Research.com Computer Science in Italy Leader Award
  • 2022 - Research.com Computer Science in Italy Leader Award
  • 2000 - Fellow of Alfred P. Sloan Foundation

Overview

Luca Trevisan is affiliated with Bocconi University in Italy. Their research spans multiple domains within computer science, with a significant presence in related fields such as physics, astronomy, and mathematics.

The main fields of study for Luca Trevisan include:

  • Computer Science
  • Physics and Astronomy
  • Mathematics

Their subfields of study further specify the research interests as:

  • Computational Theory and Mathematics
  • Statistical and Nonlinear Physics
  • Computer Networks and Communications
  • Artificial Intelligence
  • Mathematical Physics

Luca Trevisan's work covers a range of topics, notably:

  • Complexity and Algorithms in Graphs
  • Complex Network Analysis Techniques
  • Opinion Dynamics and Social Influence
  • Stochastic processes and statistical mechanics
  • Opportunistic and Delay-Tolerant Networks
  • Machine Learning and Algorithms
  • Advanced Graph Theory Research

Recent papers authored or coauthored by Luca Trevisan include:

  • From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (2020), published in SIAM Journal on Computing
  • Find Your Place: Simple Distributed Algorithms for Community Detection (2020), published in SIAM Journal on Computing
  • Consensus vs Broadcast, with and Without Noise (Extended Abstract) (2020), published in arXiv (Cornell University)
  • A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs (2022), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Expansion and flooding in dynamic random networks with node churn (2023), published in Random Structures and Algorithms

Frequent coauthors collaborating with Luca Trevisan include:

  • Andrea Clementi
  • Francesco Pasquale
  • Luca Becchetti
  • Isabella Ziccardi
  • Emanuele Natale

The scientist's publications have appeared in these venues most frequently:

  • arXiv (Cornell University)
  • SIAM Journal on Computing
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Random Structures and Algorithms
  • Theoretical Computer Science

Luca Trevisan was awarded the title of Fellow of the Alfred P. Sloan Foundation in 2000.

Best Publications

  • Pseudorandom generators without the XOR lemma

    M. Sudan;L. Trevisan;S. Vadhan

  • Counting Distinct Elements in a Data Stream

    Ziv Bar-Yossef;T. S. Jayram;Ravi Kumar;D. Sivakumar

  • Extractors and pseudorandom generators.

    Luca Trevisan

  • Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities

    James R. Lee;Shayan Oveis Gharan;Luca Trevisan

  • On the efficiency of local decoding procedures for error-correcting codes

    Jonathan Katz;Luca Trevisan

  • Notions of Reducibility between Cryptographic Primitives

    Omer Reingold;Luca Trevisan;Salil P. Vadhan

  • Gadgets, Approximation, and Linear Programming

    Luca Trevisan;Gregory B. Sorkin;Madhu Sudan;David P. Williamson

  • Non-approximability results for optimization problems on bounded degree instances

    Luca Trevisan

  • Extracting randomness from samplable distributions

    L. Trevisan;S. Vadhan

  • The Approximability of Constraint Satisfaction Problems

    Sanjeev Khanna;Madhu Sudan;Luca Trevisan;David P. Williamson

  • Some Applications of Coding Theory in Computational Complexity

    Luca Trevisan

  • Three theorems regarding testing graph properties

    Oded Goldreich;Luca Trevisan

  • A PCP characterization of NP with optimal amortized query complexity

    Alex Samorodnitsky;Luca Trevisan

  • Lower Bounds on the Efficiency of Generic Cryptographic Constructions

    Rosario Gennaro;Luca Trevisan

  • On Worst-Case to Average-Case Reductions for NP Problems

    Andrej Bogdanov;Luca Trevisan

  • Pseudorandomness and Average-Case Complexity Via Uniform Reductions

    Luca Trevisan;Salil Vadhan

  • Multi-way spectral partitioning and higher-order cheeger inequalities

    James R. Lee;Shayan Oveis Gharan;Luca Trevisan

  • Average-Case Complexity.

    Andrej Bogdanov;Luca Trevisan

  • Approximating the Minimum Spanning Tree Weight in Sublinear Time

    Bernard Chazelle;Ronitt Rubinfeld;Luca Trevisan

  • List-decoding using the XOR lemma

    L. Trevisan

  • Pseudorandom Generators without the XOR Lemma (Abstract).

    Madhu Sudan;Luca Trevisan;Salil P. Vadhan

Frequent Co-Authors

Salil P. Vadhan
Salil P. Vadhan Harvard University
Andrea E. F. Clementi
Andrea E. F. Clementi University of Rome Tor Vergata
Madhu Sudan
Madhu Sudan Harvard University
Pierluigi Crescenzi
Pierluigi Crescenzi Gran Sasso Science Institute
Omer Reingold
Omer Reingold Stanford University
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Amir Shpilka
Amir Shpilka Tel Aviv University
Prasad Raghavendra
Prasad Raghavendra University of California, Berkeley
Klaus Jansen
Klaus Jansen Kiel University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

If you’re considering studying Computer Science in the USA, there are a variety of flexible education options and career pathways available online. For those seeking a quick start or a career boost, there are easy certifications to get online. These certifications can provide specialized skills and impressive salaries without the long-term commitment of a traditional degree.

Looking to advance your qualifications even further? Some of the fastest online master’s degree programs allow you to earn an advanced degree in a matter of months. These accelerated programs are ideal for working professionals who want to stay competitive.

When choosing further study, consider the best master’s degree to get in terms of demand and long-term value. Many programs focus on the latest technologies and management trends, opening doors to leadership roles in tech.

If you’re new to higher education or looking for a solid start, associate’s degrees online offer a cost-effective way to build foundational skills. These degrees can lead directly to entry-level jobs or serve as a stepping stone toward a bachelor’s program.

Best Scientists Citing Luca Trevisan

Trending Scientists

Recently Published Articles