Christos H PAPADIMITRIOU
Christos H PAPADIMITRIOU
Verified email at columbia.edu
TitleCited byYear
Computational complexity
CH Papadimitriou
John Wiley and Sons Ltd., 2003
172872003
The traveling salesman problem: a guided tour of combinatorial optimization
DB Shmoys
Wiley 3, 1-463, 1985
42021985
Elements of the Theory of Computation
HR Lewis, CH Papadimitriou
Prentice Hall PTR, 1997
22141997
Worst-case equilibria
E Koutsoupias, C Papadimitriou
Annual Symposium on Theoretical Aspects of Computer Science, 404-413, 1999
21281999
Optimization, approximation, and complexity classes
CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 43 (3), 425-440, 1991
20601991
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
13602011
Algorithms, games, and the internet
CH Papadimitriou
International Colloquium on Automata, Languages, and Programming, 1-3, 2001
13172001
Combinatorial optimization
CH Papadimitriou
Algorithms and Complexity, 1982
12061982
The complexity of Markov decision processes
CH Papadimitriou, JN Tsitsiklis
Mathematics of operations research 12 (3), 441-450, 1987
11911987
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
11712000
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
SIAM Journal on Computing 39 (1), 195-259, 2009
11312009
Serializability of concurrent database updates
CH Papadimitriou
MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, 1979
10651979
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
9882003
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
8151988
How easy is local search?
DS Johnson, CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 37 (1), 79-100, 1988
7861988
The Euclidean travelling salesman problem is NP-complete
CH Papadimitriou
Theoretical computer science 4 (3), 237-244, 1977
7181977
Algorithms
S Dasgupta, CH Papadimitriou, UV Vazirani
McGraw-Hill Higher Education, 2008
7152008
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
6931994
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
6781994
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
6751987
The system can't perform the operation now. Try again later.
Articles 1–20