Combinatorial optimization: algorithms and complexity CH Papadimitriou, K Steiglitz Courier Corporation, 1998 | 13298* | 1998 |
Computational complexity CH Papadimitriou Encyclopedia of computer science, 260-265, 2003 | 10624 | 2003 |
Worst-case equilibria E Koutsoupias, C Papadimitriou Annual symposium on theoretical aspects of computer science, 404-413, 1999 | 2756 | 1999 |
Elements of the Theory of Computation HR Lewis, CH Papadimitriou ACM SIGACT News 29 (3), 62-78, 1998 | 2650 | 1998 |
Optimization, approximation, and complexity classes C Papadimitriou, M Yannakakis Proceedings of the twentieth annual ACM symposium on Theory of computing …, 1988 | 2475 | 1988 |
The complexity of computing a Nash equilibrium C Daskalakis, PW Goldberg, CH Papadimitriou Communications of the ACM 52 (2), 89-97, 2009 | 2023 | 2009 |
The complexity of Markov decision processes CH Papadimitriou, JN Tsitsiklis Mathematics of operations research 12 (3), 441-450, 1987 | 1848 | 1987 |
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 | 1655 | 1998 |
Algorithms, games, and the internet C Papadimitriou Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 1568 | 2001 |
The serializability of concurrent database updates CH Papadimitriou Journal of the ACM (JACM) 26 (4), 631-653, 1979 | 1310 | 1979 |
Algorithms S Dasgupta, CH Papadimitriou, UV Vazirani McGraw-Hill Higher Education, 2008 | 1167 | 2008 |
The Euclidean travelling salesman problem is NP-complete CH Papadimitriou Theoretical computer science 4 (3), 237-244, 1977 | 1118 | 1977 |
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 | 1098 | 2003 |
On generating all maximal independent sets DS Johnson, M Yannakakis, CH Papadimitriou Information Processing Letters 27 (3), 119-123, 1988 | 1069 | 1988 |
How easy is local search? DS Johnson, CH Papadimitriou, M Yannakakis Journal of computer and system sciences 37 (1), 79-100, 1988 | 1047 | 1988 |
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 | 1005 | 1994 |
The discrete geodesic problem JSB Mitchell, DM Mount, CH Papadimitriou SIAM Journal on Computing 16 (4), 647-668, 1987 | 915 | 1987 |
The complexity of multiterminal cuts E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis SIAM Journal on Computing 23 (4), 864-894, 1994 | 888 | 1994 |
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 | 859 | 2004 |
On the complexity of cooperative solution concepts X Deng, CH Papadimitriou Mathematics of operations research 19 (2), 257-266, 1994 | 796 | 1994 |