- Christos H. Papadimitriou. On the complexity of edge
traversing. Journal of the ACM, 23(3):544-554, July
1976.
- Christos H. Papadimitriou. Optimality of the fast Fourier
transform. Journal of the ACM, 26(1):95-102, January
1979.
- Christos H. Papadimitriou. The serializability of
concurrent database updates. Journal of the ACM,
26(4):631-653, October 1979.
Citations.
- Christos H. Papadimitriou and Paris C. Kanellakis. Flowshop scheduling with
limited temporary storage. Journal of the ACM,
27(3):533-549, July 1980.
- Christos H. Papadimitriou. On the complexity of integer
programming. Journal of the ACM, 28(4):765-768, October
1981.
Citations.
- Christos H. Papadimitriou and Mihalis Yannakakis. The complexity of restricted
spanning tree problems. Journal of the ACM,
29(2):285-309, April 1982.
Citations.
- Christos H. Papadimitriou. A theorem in database
concurrency control. Journal of the ACM,
29(4):998-1006, October 1982.
References,
Citations,
etc.
- Christos H. Papadimitriou. On the complexity of unique
solutions. Journal of the ACM, 31(2):392-400, April
1984.
Citations.
- Stavros S. Cosmadakis and Christos H. Papadimitriou. Updates of relational
views. Journal of the ACM, 31(4):742-760, October 1984.
- Christos H. Papadimitriou. Correction to ``A theorem in
database concurrency control''. Journal of the ACM,
32(3):750, July 1985.
References.
- John N. Tsitsiklis, Christos H. Papadimitriou, and Pierre Humblet. The performance of a
precedence-based queuing discipline. Journal of the
ACM, 33(3):593-602, July 1986.
Citations.
- N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H.
Papadimitriou. The
complexity of searching a graph. Journal of the ACM,
35(1):18-44, January 1988.
Citations.
- Phokion G. Kolaitis and Christos H. Papadimitriou. Some computational aspects of
circumscription. Journal of the ACM, 37(1):1-14,
January 1990.
Citations.
- Joseph S. B. Mitchell and Christos H. Papadimitriou. The weighted region problem:
Finding shortest paths through a weighted planar subdivision.
Journal of the ACM, 38(1):18-73, January 1991.
References,
Citations,
etc.
- E. M. Arkin, C. H. Papadimitriou, and M. Yannakakis. Modularity of cycles and paths in
graphs. Journal of the ACM, 38(2):255-274, April 1991.
Citations,
etc.
- Foto Afrati and Christos H. Papadimitriou. The parallel complexity of simple
logic programs. Journal of the ACM, 40(4):891-916,
September 1993.
References
and Citations.
- Elias Koutsoupias and Christos H. Papadimitriou. On the k-server
conjecture. Journal of the ACM, 42(5):971-983,
September 1995.
Abstract,
References,
Citations,
etc.
- Xiaotie Deng, Tiko Kameda, and Christos Papadimitriou. How to learn an unknown environment
I: The rectilinear case. Journal of the ACM,
45(2):215-245, March 1998.
References,
etc.
Shortcuts: