Luca Trevisan
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs 66
- Advanced Graph Theory Research 34
- semigroups and automata theory 11
- Artificial Intelligence top 1%
- Cryptography and Data Security 32
- Machine Learning and Algorithms 21
- Coding theory and cryptography 10
- Algorithms and Data Compression 9
-
- Optimization and Search Problems 12
- Co-authors
- Salil VadhanMadhu SudanAlex SamorodnitskyJonathan KatzShayan Oveis GharanDavid P. WilliamsonAndrej BogdanovOded Goldreich
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignArtificial Intelligence
- Journals
- Journal of the ACM (2 papers)SIAM Journal on Computing (12 papers)Theoretical Computer Science (4 papers)
- Partner nations
- United StatesItalyIsrael
In The Last Decade
Luca Trevisan
112 papers receiving 2.2k citations
Peers
Comparison fields: 5 of 80
- Computational Theory and Mathematics 1.8k
- Computer Graphics and Computer-Aided Design 218
- Artificial Intelligence 1.3k
- Discrete Mathematics and Combinatorics 127
- Computer Networks and Communications 677
Countries citing papers authored by Luca Trevisan
This map shows the geographic impact of Luca Trevisan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luca Trevisan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luca Trevisan more than expected).
Fields of papers citing papers by Luca Trevisan
This network shows the impact of papers produced by Luca Trevisan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luca Trevisan. The network helps show where Luca Trevisan may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Luca Trevisan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Friend or Foe? Population Protocols can perform Community Detection | 2017 | 1 |
| 2 | 2017 | 4 | |
| 3 | 2016 | 9 | |
| 4 | 2015 | 2 | |
| 5 | Simple Dynamics for Majority Consensus | 2013 | 1 |
| 6 | Theory and Applications of Models of Computation : 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings | 2013 | 2 |
| 7 | Improved Pseudorandom Generators for Depth 2 Circuits. | 2009 | 2 |
| 8 | Non-uniform attacks against one-way functions and PRGs. | 2009 | 2 |
| 9 | 2008 | 18 | |
| 10 | Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem | 2005 | 6 |
| 11 | 2005 | 1 | |
| 12 | Lecture Notes on Computational Complexity | 2004 | 5 |
| 13 | On epsilon-Biased Generators in NC0 | 2003 | 6 |
| 14 | 2001 | 0 | |
| 15 | Lower Bounds on the Efficiency of Generic Cryptographic Constructions | 2000 | 1 |
| 16 | Recycling Queries in PCPs and in Linearity Tests | 1998 | 12 |
| 17 | Constructions of Near-Optimal Extractors Using Pseudo-Random Generators | 1998 | 13 |
| 18 | Recent Advances Towards Proving P = BPP. | 1998 | 11 |
| 19 | A tight characterization of NP with 3 query PCPs | 1998 | 3 |
| 20 | Gadgets, Approximation, and Linear Programming (extended abstract). | 1996 | 6 |
About Luca Trevisan
Luca Trevisan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 117 papers that have together received 2.5k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (66 papers), Advanced Graph Theory Research (34 papers), Cryptography and Data Security (32 papers), Machine Learning and Algorithms (21 papers), Optimization and Search Problems (12 papers), semigroups and automata theory (11 papers), Coding theory and cryptography (10 papers) and Algorithms and Data Compression (9 papers). The work is most often cited by research in Computational Theory and Mathematics (1.8k citations), Computer Graphics and Computer-Aided Design (218 citations) and Artificial Intelligence (1.3k citations). Luca Trevisan has collaborated with scholars based in United States, Italy and Israel. Frequent co-authors include Salil Vadhan, Madhu Sudan, Alex Samorodnitsky, Jonathan Katz, Shayan Oveis Gharan, David P. Williamson, Andrej Bogdanov, Oded Goldreich, James R. Lee and Andrea Clementi. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.