Christos H PAPADIMITRIOU
Christos H PAPADIMITRIOU
Verified email at columbia.edu
TitleCited byYear
Computational complexity
CH Papadimitriou
John Wiley and Sons Ltd., 2003
175842003
The traveling salesman problem; a guided tour of combinatorial optimization
EL Lawler, JK Lenstra, AHG Rinnooy Kan, DB Shmoys
Wiley, Chichester, 1985
41271985
Elements of the Theory of Computation
HR Lewis, CH Papadimitriou
Prentice Hall PTR, 1997
22401997
Worst-case equilibria
E Koutsoupias, C Papadimitriou
Annual Symposium on Theoretical Aspects of Computer Science, 404-413, 1999
21741999
Optimization, approximation, and complexity classes
CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 43 (3), 425-440, 1991
20781991
Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework.
J Alcalá-Fdez, A Fernández, J Luengo, J Derrac, S García, L Sánchez, ...
Journal of Multiple-Valued Logic & Soft Computing 17, 2011
14652011
Algorithms, games, and the internet
CH Papadimitriou
International Colloquium on Automata, Languages, and Programming, 1-3, 2001
13462001
The complexity of Markov decision processes
CH Papadimitriou, JN Tsitsiklis
Mathematics of operations research 12 (3), 441-450, 1987
12371987
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou, P Raghavan, H Tamaki, S Vempala
Journal of Computer and System Sciences 61 (2), 217-235, 2000
12022000
Combinatorial optimization
CH Papadimitriou, K Steiglitz
Prentice Hall, 1982
11691982
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
SIAM Journal on Computing 39 (1), 195-259, 2009
11632009
Serializability of concurrent database updates
CH Papadimitriou
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, 1979
10881979
Geographic routing without location information
A Rao, S Ratnasamy, C Papadimitriou, S Shenker, I Stoica
Proceedings of the 9th annual international conference on Mobile computing …, 2003
10022003
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
8411988
How easy is local search?
DS Johnson, CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 37 (1), 79-100, 1988
7961988
Algorithms
S Dasgupta, CH Papadimitriou, UV Vazirani
McGraw-Hill Higher Education, 2008
7492008
The Euclidean travelling salesman problem is NP-complete
CH Papadimitriou
Theoretical computer science 4 (3), 237-244, 1977
7341977
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
7071994
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
6941987
On the complexity of the parity argument and other inefficient proofs of existence
CH Papadimitriou
Journal of Computer and system Sciences 48 (3), 498-532, 1994
6901994
The system can't perform the operation now. Try again later.
Articles 1–20