2016 - IEEE John von Neumann Medal "For providing a deeper understanding of computational complexity and its implications for approximation algorithms, artificial intelligence, economics, database theory, and biology."
2009 - Member of the National Academy of Sciences
2006 - Member of Academia Europaea
2002 - Member of the National Academy of Engineering For contributions to complexity theory, database theory, and combinatorial optimization.
2001 - ACM Fellow For outstanding contributions to complexity theory, database theory and combinatorial optimization.
2001 - Fellow of the American Academy of Arts and Sciences
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.
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.
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.
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.
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou;Kenneth Steiglitz.
Elements of the Theory of Computation
Harry R. Lewis;Christos H. Papadimitriou.
Elias Koutsoupias;Christos Papadimitriou.
symposium on theoretical aspects of computer science (1999)
Optimization, approximation, and complexity classes
Christos H. Papadimitriou;Mihalis Yannakakis.
Journal of Computer and System Sciences (1991)
Latent semantic indexing: a probabilistic analysis
Christos H. Papadimitriou;Hisao Tamaki;Prabhakar Raghavan;Santosh Vempala.
symposium on principles of database systems (1998)
Algorithms, games, and the internet
symposium on the theory of computing (2001)
The Complexity of Markov Decision Processes
Christos H. Papadimitriou;John N. Tsitsiklis.
Mathematics of Operations Research (1987)
The Complexity of Computing a Nash Equilibrium
Constantinos Daskalakis;Paul W. Goldberg;Christos H. Papadimitriou.
SIAM Journal on Computing (2009)
The serializability of concurrent database updates
Christos H. Papadimitriou.
Journal of the ACM (1979)
Geographic routing without location information
Ananth Rao;Sylvia Ratnasamy;Christos Papadimitriou;Scott Shenker.
acm/ieee international conference on mobile computing and networking (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: