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

Luca Trevisan publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Luca Trevisan sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 244 publications — 61st percentile

61% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Luca Trevisan D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Luca Trevisan sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 61 D-Index — 79th percentile

79% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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