Prati
Christos H PAPADIMITRIOU
Christos H PAPADIMITRIOU
Potvrđena adresa e-pošte na columbia.edu
Naslov
Citirano
Citirano
Godina
Combinatorial optimization: algorithms and complexity
CH Papadimitriou, K Steiglitz
Courier Corporation, 1998
201801998
Worst-case equilibria
E Koutsoupias, C Papadimitriou
Annual symposium on theoretical aspects of computer science, 404-413, 1999
25901999
Elements of the Theory of Computation
HR Lewis, CH Papadimitriou
ACM SIGACT News 29 (3), 62-78, 1998
24821998
Optimization, approximation, and complexity classes
C Papadimitriou, M Yannakakis
Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988
23391988
Combinatorial optimization
CH Papadimitriou
Algorithms and complexity, 1982
19731982
The complexity of computing a Nash equilibrium
C Daskalakis, PW Goldberg, CH Papadimitriou
SIAM Journal on Computing 39 (1), 195-259, 2009
17292009
The complexity of Markov decision processes
CH Papadimitriou, JN Tsitsiklis
Mathematics of operations research 12 (3), 441-450, 1987
16781987
Latent semantic indexing: A probabilistic analysis
CH Papadimitriou, H Tamaki, P Raghavan, S Vempala
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1998
15491998
Algorithms, games, and the internet
C Papadimitriou
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
14922001
The serializability of concurrent database updates
CH Papadimitriou
Journal of the ACM (JACM) 26 (4), 631-653, 1979
12571979
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
10832003
Algorithms
S Dasgupta, CH Papadimitriou, UV Vazirani
McGraw-Hill Higher Education, 2008
10292008
The Euclidean travelling salesman problem is NP-complete
CH Papadimitriou
Theoretical computer science 4 (3), 237-244, 1977
10291977
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
10011988
How easy is local search?
DS Johnson, CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 37 (1), 79-100, 1988
9411988
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
9071994
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
8341994
The discrete geodesic problem
JSB Mitchell, DM Mount, CH Papadimitriou
SIAM Journal on Computing 16 (4), 647-668, 1987
8301987
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
8092004
Free-riding and whitewashing in peer-to-peer systems
M Feldman, C Papadimitriou, J Chuang, I Stoica
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives …, 2004
7412004
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20