What is he best known for?
The fields of study he is best known for:
- Artificial intelligence
- Algorithm
- Computer network
His primary areas of study are Combinatorics, Discrete mathematics, Mathematical optimization, Time complexity and Algorithm.
His Combinatorics research incorporates themes from Function and Nondeterministic algorithm.
His study looks at the intersection of Discrete mathematics and topics like Graph theory with Vertex separator, Vertex, Undirected graph and Directed acyclic graph.
As part of the same scientific family, Christos H. Papadimitriou usually focuses on Mathematical optimization, concentrating on Computational complexity theory and intersecting with Approximation algorithm.
His Time complexity research is multidisciplinary, relying on both Linear programming, Local search and Game theory.
His research integrates issues of Polynomial and Shortest path problem in his study of Algorithm.
His most cited work include:
- Combinatorial Optimization: Algorithms and Complexity (5653 citations)
- Worst-case equilibria (1567 citations)
- Optimization, approximation, and complexity classes (1451 citations)
What are the main themes of his work throughout his whole career to date?
Christos H. Papadimitriou mainly focuses on Combinatorics, Discrete mathematics, Mathematical optimization, Mathematical economics and Nash equilibrium.
His Combinatorics study frequently draws connections between related disciplines such as Travelling salesman problem.
Christos H. Papadimitriou is interested in Complexity class, which is a field of Discrete mathematics.
His work in Mathematical optimization is not limited to one particular discipline; it also encompasses Computational complexity theory.
His work is connected to Game theory, Equilibrium selection, Repeated game, Normal-form game and Folk theorem, as a part of Mathematical economics.
Nash equilibrium is closely attributed to Correlated equilibrium in his work.
He most often published in these fields:
- Combinatorics (22.95%)
- Discrete mathematics (21.17%)
- Mathematical optimization (16.19%)
What were the highlights of his more recent work (between 2012-2021)?
- Mathematical economics (13.17%)
- Mathematical optimization (16.19%)
- Nash equilibrium (12.99%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Mathematical economics, Mathematical optimization, Nash equilibrium, Computation and Combinatorics.
His Mathematical optimization research incorporates themes from Common value auction and Mechanism design.
His work carried out in the field of Nash equilibrium brings together such families of science as Fixed point and Markov chain.
His Computation study incorporates themes from Theoretical computer science and Cognition.
His work in Combinatorics addresses issues such as Discrete mathematics, which are connected to fields such as Computational complexity theory.
His Game theory research is multidisciplinary, incorporating perspectives in Time complexity and Algorithm.
Between 2012 and 2021, his most popular works were:
- Cycles in adversarial regularized learning (84 citations)
- Strategic Classification (81 citations)
- Optimum Statistical Estimation with Strategic Data Sources (53 citations)
In his most recent research, the most cited papers focused on:
- Artificial intelligence
- Algorithm
- Computer network
Christos H. Papadimitriou mainly investigates Mathematical economics, Mathematical optimization, Nash equilibrium, Game theory and Computation.
His Mathematical economics research includes elements of Hash function and Counterintuitive.
His work on Submodular set function as part of general Mathematical optimization research is often related to Approximate equilibrium, thus linking different fields of science.
His Game theory study integrates concerns from other disciplines, such as Time complexity and Algorithm.
His Computation study which covers Computer graphics that intersects with Theoretical computer science.
His Epsilon-equilibrium research incorporates elements of Correlated equilibrium, Reduction, Combinatorics, Hardness of approximation and Exponential function.
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.
