Citation: Ch. Papadimitriou et M. Yannakakis, TIE-BREAKING SEMANTICS AND STRUCTURAL TOTALITY, Journal of computer and system sciences, 54(1), 1997, pp. 48-60
Citation: Ch. Papadimitriou et M. Yannakakis, ON LIMITED NONDETERMINISM AND THE COMPLEXITY OF THE V-C DIMENSION, Journal of computer and system sciences, 53(2), 1996, pp. 161-170
Citation: P. Crescenzi et Ch. Papadimitriou, REVERSIBLE SIMULATION OF SPACE-BOUNDED COMPUTATIONS, Theoretical computer science, 143(1), 1995, pp. 159-165
Citation: E. Koutsoupias et Ch. Papadimitriou, ON THE K-SERVER CONJECTURE, Journal of the Association for Computing Machinery, 42(5), 1995, pp. 971-983
Citation: Xt. Deng et Ch. Papadimitriou, ON THE COMPLEXITY OF COOPERATIVE SOLUTION CONCEPTS, Mathematics of operations research, 19(2), 1994, pp. 257-266
Citation: Ch. Papadimitriou, ON THE COMPLEXITY OF THE PARITY ARGUMENT AND OTHER INEFFICIENT PROOFSOF EXISTENCE, Journal of computer and system sciences, 48(3), 1994, pp. 498-532
Citation: Ch. Papadimitriou et al., COMPUTING THE THROUGHPUT OF A NETWORK WITH DEDICATED LINES, Discrete applied mathematics, 42(2-3), 1993, pp. 271-278
Citation: F. Afrati et Ch. Papadimitriou, THE PARALLEL COMPLEXITY OF SIMPLE LOGIC PROGRAMS, Journal of the Association for Computing Machinery, 40(4), 1993, pp. 891-916