What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Computational complexity theory are his primary areas of study.
His study connects Optimization problem and Combinatorics.
He studies Regular graph, a branch of Discrete mathematics.
His Approximation algorithm research is multidisciplinary, relying on both Linear programming, Semidefinite programming and Spanning tree.
Luca Trevisan interconnects Independent set, Bounded function and Degree in the investigation of issues within Time complexity.
His Binary logarithm study deals with Sequential decoding intersecting with Lemma and List decoding.
His most cited work include:
- Counting Distinct Elements in a Data Stream (422 citations)
- Pseudorandom generators without the XOR lemma (359 citations)
- Extractors and pseudorandom generators. (281 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Approximation algorithm, Time complexity and Upper and lower bounds.
His studies in Combinatorics integrate themes in fields like Bounded function and Constant.
The Discrete mathematics study which covers Pseudorandom number generator that intersects with Lemma.
His Approximation algorithm study incorporates themes from Linear programming, Combinatorial optimization and Semidefinite programming.
His research investigates the connection between Time complexity and topics such as Polynomial that intersect with issues in Function.
His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Permutation and Laplace operator.
He most often published in these fields:
- Combinatorics (58.49%)
- Discrete mathematics (55.09%)
- Approximation algorithm (17.74%)
What were the highlights of his more recent work (between 2015-2021)?
- Combinatorics (58.49%)
- Graph (6.42%)
- Upper and lower bounds (13.21%)
In recent papers he was focusing on the following fields of study:
Luca Trevisan mainly investigates Combinatorics, Graph, Upper and lower bounds, Discrete mathematics and Time complexity.
His study on Approximation algorithm, Degree and Maximum cut is often connected to Omega as part of broader study in Combinatorics.
His Approximation algorithm research focuses on Dominating set and how it connects with Clique, Parameterized complexity and Complete bipartite graph.
His research integrates issues of Binary logarithm, Complete graph, Ramanujan's sum and Laplace operator in his study of Upper and lower bounds.
Luca Trevisan studies Discrete mathematics, namely Vertex.
His research in Time complexity intersects with topics in Bounded function and Constant.
Between 2015 and 2021, his most popular works were:
- From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More (44 citations)
- Stabilizing consensus with many opinions (35 citations)
- Simple Dynamics for Plurality Consensus (31 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
His scientific interests lie mostly in Combinatorics, Algorithm, Upper and lower bounds, Constant and Approximation algorithm.
His study ties his expertise on Exponential function together with the subject of Combinatorics.
He combines subjects such as Logarithm, Graph and Centrality with his study of Algorithm.
His Upper and lower bounds research focuses on Laplace operator and how it relates to Eigenvalues and eigenvectors and Complete graph.
His studies deal with areas such as Structure, Multiplicative function, Rank, Degree and Matching as well as Constant.
His work is dedicated to discovering how Polynomial, Discrete mathematics are connected with Bounded function and other disciplines.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
