Christos H PAPADIMITRIOU
Christos H PAPADIMITRIOU
E-mail confirmado em columbia.edu
Título
Citado por
Citado por
Ano
Combinatorial optimization: algorithms and complexity
CH Papadimitriou, K Steiglitz
Courier Corporation, 1998
209861998
Worst-case equilibria
E Koutsoupias, C Papadimitriou
Annual Symposium on Theoretical Aspects of Computer Science, 404-413, 1999
24571999
Elements of the Theory of Computation
HR Lewis, CH Papadimitriou
ACM SIGACT News 29 (3), 62-78, 1998
24101998
Optimization, approximation, and complexity classes
CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 43 (3), 425-440, 1991
22771991
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
SIAM Journal on Computing 39 (1), 195-259, 2009
15352009
The complexity of Markov decision processes
CH Papadimitriou, JN Tsitsiklis
Mathematics of operations research 12 (3), 441-450, 1987
15311987
Algorithms, games, and the internet
C Papadimitriou
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
14682001
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
14652000
The serializability of concurrent database updates
CH Papadimitriou
Journal of the ACM (JACM) 26 (4), 631-653, 1979
12201979
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
10662003
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
9661988
Algorithms
S Dasgupta, CH Papadimitriou, UV Vazirani
McGraw-Hill Higher Education, 2008
9652008
The Euclidean travelling salesman problem is NP-complete
CH Papadimitriou
Theoretical computer science 4 (3), 237-244, 1977
9511977
How easy is local search?
DS Johnson, CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 37 (1), 79-100, 1988
9071988
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
8431994
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
8091994
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
7861987
The complexity of pure Nash equilibria
A Fabrikant, C Papadimitriou, K Talwar
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
7732004
Shortest path algorithms: an evaluation using real road networks
FB Zhan, CE Noon
Transportation science 32 (1), 65-73, 1998
7511998
Free-riding and whitewashing in peer-to-peer systems
M Feldman, C Papadimitriou, J Chuang, I Stoica
IEEE Journal on selected areas in communications 24 (5), 1010-1019, 2006
7232006
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20