Christos H. Papadimitriou

Author

University of California, Berkeley ORCID

Also Known As

C. H. Papadimitriou, C.H. Papadimitriou, Christos H Papadimitriou, Christos H. Papadimitriou, Christos Papadimitriou, Papadimitriou, Christos, Papadimitriou, Christos H., Papadimitriou, Christos,

271

Publications

28.8K

Citations

H-Index

167

Concepts

All Affiliations

University of California, Berkeley University of California San Diego Stanford University Columbia University Massachusetts Institute of Technology

About

Christos H. Papadimitriou is an author at University of California, Berkeley specializing in engineering, combinatorial optimization, and computer science.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	55	82	16.8K
2	Business	37	56	8.9K
3	Education	7	7	1.3K
4	Arts	6	6	321
5	Law	1	1	50

Christos H. Papadimitriou

123

Publications

20.7K

Citations

H-Index

Page 1

	Year	Citations
Optimization, approximation, and complexity classes Christos H. Papadimitriou, Mihalis Yannakakis Journal of Computer and System Sciences EngineeringComplexity ClassesAnalysis Of AlgorithmComputational ComplexityApproximation Method	1991	1.6K
The Complexity of Markov Decision Processes Christos H. Papadimitriou, John N. Tsitsiklis Mathematics of Operations Research Mathematical ProgrammingEngineeringGame TheoryComputational ComplexityMarkov Decision Processes	1987	1.3K
Algorithms, games, and the internet Christos H. Papadimitriou Mathematical EconomicsMechanism DesignEngineeringNon-cooperative Game TheoryNetwork Game	2001	1.1K
The Complexity of Computing a Nash Equilibrium Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou SIAM Journal on Computing EngineeringGraph TheoryNon-cooperative Game TheoryEquilibrium AnalysisEquilibrium Problem	2009	936
On the complexity of the parity argument and other inefficient proofs of existence Christos H. Papadimitriou Journal of Computer and System Sciences EngineeringAutomated ReasoningParity ArgumentProof ComplexityFormal Methods	1994	791
The Euclidean travelling salesman problem is NP-complete Christos H. Papadimitriou Theoretical Computer Science Mathematical ProgrammingEngineeringGraph TheoryTraveling Salesman ProblemCombinatorial Problem	1977	765
Worst-case equilibria Christos H. Papadimitriou Computer Science Review	2009	668
The complexity of pure Nash equilibria Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar Congestion GamesEngineeringPure Nash EquilibriaPrice Of AnarchyEquilibrium Problem	2004	656
On the Complexity of Cooperative Solution Concepts Xiaotie Deng, Christos H. Papadimitriou Mathematics of Operations Research Theory Of ComputingVarious Solution ConceptsCooperative SystemEngineeringGraph Theory	1994	623
Hamilton Paths in Grid Graphs Alon Itai, Christos H. Papadimitriou, Jayme L. Szwarcfiter SIAM Journal on Computing Mathematical ProgrammingHamilton PathsDirected GraphEngineeringPlanar Graph	1982	507

Page 1