What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algorithm
- Real number
His primary areas of study are Combinatorics, Discrete mathematics, Time complexity, Matching and Binary logarithm.
In his study, Distortion is strongly linked to Multiplicative function, which falls under the umbrella field of Combinatorics.
His work in the fields of Discrete mathematics, such as e, Log-log plot and Euclidean minimum spanning tree, intersects with other areas such as Matrix multiplication.
His work in Time complexity covers topics such as Maximum weight matching which are related to areas like Approximation algorithm.
His studies deal with areas such as Upper and lower bounds and Bipartite graph as well as Binary logarithm.
His research in Upper and lower bounds intersects with topics in Randomized algorithm, Spanning tree, Minimum spanning tree and Vertex.
His most cited work include:
- An optimal minimum spanning tree algorithm (206 citations)
- Linear-Time Approximation for Maximum Weight Matching (156 citations)
- A new approach to all-pairs shortest paths on real-weighted graphs (145 citations)
What are the main themes of his work throughout his whole career to date?
Seth Pettie mainly investigates Combinatorics, Discrete mathematics, Binary logarithm, Upper and lower bounds and Algorithm.
His Combinatorics research incorporates themes from Function and Distributed algorithm.
His work deals with themes such as Shortest Path Faster Algorithm, Graph, Subsequence, Matching and Yen's algorithm, which intersect with Discrete mathematics.
His Binary logarithm research is multidisciplinary, incorporating perspectives in Leader election, Data structure and Arboricity, Planar graph.
His study focuses on the intersection of Upper and lower bounds and fields such as Randomized algorithm with connections in the field of Deterministic algorithm and Lovász local lemma.
His Algorithm study integrates concerns from other disciplines, such as Graph theory, Mathematical optimization and Spanning tree.
He most often published in these fields:
- Combinatorics (72.35%)
- Discrete mathematics (40.00%)
- Binary logarithm (23.53%)
What were the highlights of his more recent work (between 2018-2021)?
- Combinatorics (72.35%)
- Binary logarithm (23.53%)
- Upper and lower bounds (22.35%)
In recent papers he was focusing on the following fields of study:
Seth Pettie spends much of his time researching Combinatorics, Binary logarithm, Upper and lower bounds, Discrete mathematics and Cardinality.
His studies in Combinatorics integrate themes in fields like Distributed algorithm, Space and Data structure.
Seth Pettie interconnects Randomized algorithm and Communication complexity in the investigation of issues within Binary logarithm.
He has researched Upper and lower bounds in several fields, including Matching, Function, Complement and Conjecture.
Discrete mathematics and Communication channel are two areas of study in which Seth Pettie engages in interdisciplinary research.
His work carried out in the field of Graph brings together such families of science as Structure and Sublinear function.
Between 2018 and 2021, his most popular works were:
- Distributed triangle detection via expander decomposition (28 citations)
- Thorup–Zwick emulators are universally optimal hopsets (23 citations)
- A Time Hierarchy Theorem for the LOCAL Model (21 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Real number
- Algorithm
Seth Pettie mostly deals with Combinatorics, Distributed algorithm, Lovász local lemma, Discrete mathematics and Edge coloring.
His study in Sublinear function, Graph, Arboricity and Enumeration falls within the category of Combinatorics.
His Distributed algorithm research is multidisciplinary, relying on both Partition, Connected component, Degree and Graph partition.
His Lovász local lemma research includes elements of Function, Class and Turing machine.
His study in the field of Communication complexity also crosses realms of Treewidth.
Combining a variety of fields, including Edge coloring, Symmetry breaking, Vertex and Exponential function, are what the author presents in his essays.
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.
