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).
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 of co-authors of Luca Trevisan
This figure shows the co-authorship network connecting the top 25 collaborators of Luca Trevisan.
A scholar is included among the top collaborators of Luca Trevisan based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Luca Trevisan. Luca Trevisan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, et al.. (2017). Friend or Foe? Population Protocols can perform Community Detection. arXiv (Cornell University).1 indexed citations
Gharan, Shayan Oveis & Luca Trevisan. (2015). . Theory of Computing. 11(1). 241–256.2 indexed citations
5.
Becchetti, Luca, Andrea Clementi, Emanuele Natale, et al.. (2013). Simple Dynamics for Majority Consensus. arXiv (Cornell University).1 indexed citations
6.
Trevisan, Luca, et al.. (2013). Theory and Applications of Models of Computation : 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings. Springer eBooks.2 indexed citations
7.
De, Anindya, Omid Etesami, Luca Trevisan, & Madhur Tulsiani. (2009). Improved Pseudorandom Generators for Depth 2 Circuits.. Electronic colloquium on computational complexity. 16. 141.2 indexed citations
8.
De, Anindya, Luca Trevisan, & Madhur Tulsiani. (2009). Non-uniform attacks against one-way functions and PRGs.. Electronic colloquium on computational complexity. 16. 113.2 indexed citations
9.
Trevisan, Luca. (2008). . Theory of Computing. 4(1). 111–128.18 indexed citations
10.
Reingold, Omer, Luca Trevisan, & Salil Vadhan. (2005). Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electronic colloquium on computational complexity.6 indexed citations
Trevisan, Luca. (2004). Lecture Notes on Computational Complexity.5 indexed citations
13.
Mossel, Elchanan, Amir Shpilka, & Luca Trevisan. (2003). On epsilon-Biased Generators in NC0. Random Structures and Algorithms. 29. 56–81.6 indexed citations
Gennaro, Rosario & Luca Trevisan. (2000). Lower Bounds on the Efficiency of Generic Cryptographic Constructions. IACR Cryptology ePrint Archive. 2000. 17.1 indexed citations
16.
Trevisan, Luca. (1998). Recycling Queries in PCPs and in Linearity Tests. Electronic colloquium on computational complexity. 5.12 indexed citations
17.
Trevisan, Luca. (1998). Constructions of Near-Optimal Extractors Using Pseudo-Random Generators. Electronic colloquium on computational complexity. 5.13 indexed citations
18.
Clementi, Andrea, Andrea Roli, & Luca Trevisan. (1998). Recent Advances Towards Proving P = BPP.. Bulletin of the European Association for Theoretical Computer Science. 64.11 indexed citations
19.
Guruswami, Venkatesan, et al.. (1998). A tight characterization of NP with 3 query PCPs. Electronic colloquium on computational complexity. 5.3 indexed citations
20.
Trevisan, Luca, Gregory B. Sorkin, Madhu Sudan, & David P. Williamson. (1996). Gadgets, Approximation, and Linear Programming (extended abstract).. 617–626.6 indexed citations
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.