The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christos H. Papadimitriou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christos H. Papadimitriou
    The serializability of concurrent database updates. [Citation Graph (114, 0)][DBLP]
    J. ACM, 1979, v:26, n:4, pp:631-653 [Journal]
  2. Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
    Inclusion Dependencies and Their Interaction with Functional Dependencies. [Citation Graph (28, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:1, pp:29-59 [Journal]
  3. Phokion G. Kolaitis, Christos H. Papadimitriou
    Why Not Negation by Fixpoint? [Citation Graph (25, 12)][DBLP]
    PODS, 1988, pp:231-239 [Conf]
  4. Stavros S. Cosmadakis, Christos H. Papadimitriou
    Updates of Relational Views. [Citation Graph (24, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:742-760 [Journal]
  5. Philip A. Bernstein, James B. Rothnie Jr., Nathan Goodman, Christos H. Papadimitriou
    The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case). [Citation Graph (24, 0)][DBLP]
    IEEE Trans. Software Eng., 1978, v:4, n:3, pp:154-168 [Journal]
  6. Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou
    Inclusion Dependencies and Their Interaction with Functional Dependencies. [Citation Graph (23, 24)][DBLP]
    PODS, 1982, pp:171-176 [Conf]
  7. H. T. Kung, Christos H. Papadimitriou
    An Optimality Theory of Concurrency Control for Databases. [Citation Graph (23, 8)][DBLP]
    SIGMOD Conference, 1979, pp:116-126 [Conf]
  8. Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
    Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP]
    FOCS, 1979, pp:286-297 [Conf]
  9. Mihalis Yannakakis, Christos H. Papadimitriou
    Algebraic Dependencies. [Citation Graph (18, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:1, pp:2-41 [Journal]
  10. Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou
    On the Analysis of Indexing Schemes. [Citation Graph (14, 21)][DBLP]
    PODS, 1997, pp:249-256 [Conf]
  11. Christos H. Papadimitriou, Paris C. Kanellakis
    On Concurrency Control by Multiple Versions. [Citation Graph (14, 12)][DBLP]
    ACM Trans. Database Syst., 1984, v:9, n:1, pp:89-99 [Journal]
  12. Foto N. Afrati, Christos H. Papadimitriou
    The Parallel Complexity of Simple Chain Queries. [Citation Graph (12, 2)][DBLP]
    PODS, 1987, pp:210-213 [Conf]
  13. Christos H. Papadimitriou, Paris C. Kanellakis
    On Concurrency Control by Multiple Versions. [Citation Graph (12, 12)][DBLP]
    PODS, 1982, pp:76-82 [Conf]
  14. Mihalis Yannakakis, Christos H. Papadimitriou
    Algebraic Dependencies (Extended Abstract) [Citation Graph (11, 0)][DBLP]
    FOCS, 1980, pp:328-332 [Conf]
  15. Paris C. Kanellakis, Christos H. Papadimitriou
    The Complexity of Distributed Concurrency Control [Citation Graph (9, 0)][DBLP]
    FOCS, 1981, pp:185-197 [Conf]
  16. H. T. Kung, Christos H. Papadimitriou
    An Optimality Theory of Concurrency Control for Databases. [Citation Graph (9, 0)][DBLP]
    Acta Inf., 1983, v:19, n:, pp:1-11 [Journal]
  17. Christos H. Papadimitriou, Dan Suciu, Victor Vianu
    Topological Queries in Spatial Databases. [Citation Graph (8, 13)][DBLP]
    PODS, 1996, pp:81-92 [Conf]
  18. Phokion G. Kolaitis, Christos H. Papadimitriou
    Why not Negation by Fixpoint? [Citation Graph (8, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:1, pp:125-144 [Journal]
  19. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman
    Convergence of Sideways Query Evaluation. [Citation Graph (7, 1)][DBLP]
    PODS, 1986, pp:24-30 [Conf]
  20. Stavros S. Cosmadakis, Christos H. Papadimitriou
    Updates of Relational Views. [Citation Graph (7, 23)][DBLP]
    PODS, 1983, pp:317-331 [Conf]
  21. Christos H. Papadimitriou
    Concurrency Control by Locking. [Citation Graph (7, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:215-226 [Journal]
  22. Christos H. Papadimitriou
    On the Power of Locking. [Citation Graph (6, 9)][DBLP]
    SIGMOD Conference, 1981, pp:148-154 [Conf]
  23. Witold Lipski Jr., Christos H. Papadimitriou
    A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
  24. Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan
    Information Caching for Delivery of Personalized Video Programs on Home Entertainment Channels. [Citation Graph (5, 0)][DBLP]
    ICMCS, 1994, pp:214-223 [Conf]
  25. Serge Abiteboul, Christos H. Papadimitriou, Victor Vianu
    The Power of Reflective Relational Machines [Citation Graph (5, 0)][DBLP]
    LICS, 1994, pp:230-240 [Conf]
  26. Christos H. Papadimitriou, Mihalis Yannakakis
    Tie-Breaking Semantics and Structural Totality. [Citation Graph (5, 9)][DBLP]
    PODS, 1992, pp:16-22 [Conf]
  27. Christos H. Papadimitriou
    A theorem in database concurrency control. [Citation Graph (5, 0)][DBLP]
    J. ACM, 1982, v:29, n:4, pp:998-1006 [Journal]
  28. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman
    On the Convergence of Query Evaluation. [Citation Graph (5, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:2, pp:341-359 [Journal]
  29. Thanasis Hadzilacos, Christos H. Papadimitriou
    Algorithmic Aspects of Multiversion Concurrency Control. [Citation Graph (4, 6)][DBLP]
    PODS, 1985, pp:96-104 [Conf]
  30. Paris C. Kanellakis, Christos H. Papadimitriou
    Is Distributed Locking Harder? [Citation Graph (3, 15)][DBLP]
    PODS, 1982, pp:98-107 [Conf]
  31. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala
    Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (3, 4)][DBLP]
    PODS, 1998, pp:159-168 [Conf]
  32. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Facets (and Some Facets of Complexity) [Citation Graph (3, 0)][DBLP]
    STOC, 1982, pp:255-260 [Conf]
  33. Christos H. Papadimitriou, Mihalis Yannakakis
    A Note on Succinct Representations of Graphs [Citation Graph (3, 0)][DBLP]
    Information and Control, 1986, v:71, n:3, pp:181-185 [Journal]
  34. John G. Kollias, Yannis Manolopoulos, Christos H. Papadimitriou
    The Optimum Execution Order of Queries in Linear Storage. [Citation Graph (3, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:3, pp:141-145 [Journal]
  35. Paris C. Kanellakis, Christos H. Papadimitriou
    Is Distributed Locking Harder? [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:1, pp:103-120 [Journal]
  36. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Facets (and Some Facets of Complexity). [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:244-259 [Journal]
  37. Christos H. Papadimitriou, Jeffrey D. Ullman
    A Communication-Time Tradeoff. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:639-646 [Journal]
  38. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Complexity of Database Queries. [Citation Graph (2, 12)][DBLP]
    PODS, 1997, pp:12-19 [Conf]
  39. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1992, pp:241-251 [Conf]
  40. John N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet
    The performance of a precedence-based queuing discipline. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:593-602 [Journal]
  41. Thanasis Hadzilacos, Christos H. Papadimitriou
    Algorithmic Aspects of Multiversion Concurrency Control. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:2, pp:297-310 [Journal]
  42. Christos H. Papadimitriou, Mihalis Yannakakis
    On Limited Nondeterminism and the Complexity of the V-C Dimension. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:161-170 [Journal]
  43. Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis
    On the Predictability of Coupled Automata: An Allegory about Chaos [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:788-793 [Conf]
  44. Christos H. Papadimitriou
    On Selecting a Satisfying Truth Assignment (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1991, pp:163-169 [Conf]
  45. Christos H. Papadimitriou, Martha Sideri
    On Finding Extensions of Default Theories. [Citation Graph (1, 8)][DBLP]
    ICDT, 1992, pp:276-281 [Conf]
  46. Christos H. Papadimitriou, Mihalis Yannakakis
    Optimization, Approximation, and Complexity Classes (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:229-234 [Conf]
  47. Christos H. Papadimitriou, Mihalis Yannakakis
    Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:510-513 [Conf]
  48. Christos H. Papadimitriou, Mihalis Yannakakis
    On complexity as bounded rationality (extended abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:726-733 [Conf]
  49. Christos H. Papadimitriou, Kenneth Steiglitz
    Some Complexity Results for the Traveling Salesman Problem [Citation Graph (1, 0)][DBLP]
    STOC, 1976, pp:1-9 [Conf]
  50. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan
    A Microeconomic View of Data Mining. [Citation Graph (1, 0)][DBLP]
    Data Min. Knowl. Discov., 1998, v:2, n:4, pp:311-324 [Journal]
  51. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    On Generating All Maximal Independent Sets. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:119-123 [Journal]
  52. Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis
    Modularity of Cycles and Paths in Graphs. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:255-274 [Journal]
  53. Foto N. Afrati, Christos H. Papadimitriou
    The Parallel Complexity of Simple Logic Programs. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1993, v:40, n:4, pp:891-916 [Journal]
  54. Phokion G. Kolaitis, Christos H. Papadimitriou
    Some Computational Aspects of Circumscription [Citation Graph (1, 0)][DBLP]
    J. ACM, 1990, v:37, n:1, pp:1-14 [Journal]
  55. Christos H. Papadimitriou
    Correction to ``A Theorem in Database Concurrency Control'' [Citation Graph (1, 0)][DBLP]
    J. ACM, 1985, v:32, n:3, pp:750- [Journal]
  56. Christos H. Papadimitriou
    On the complexity of integer programming. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:765-768 [Journal]
  57. Christos H. Papadimitriou
    On the complexity of unique solutions. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:392-400 [Journal]
  58. Goran Gogic, Christos H. Papadimitriou, Martha Sideri
    Incremental Recompilation of Knowledge. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:922-927 [Conf]
  59. Phokion G. Kolaitis, Christos H. Papadimitriou
    Some Computational Aspects of Circumscription. [Citation Graph (0, 0)][DBLP]
    AAAI, 1988, pp:455-469 [Conf]
  60. Christos H. Papadimitriou, David Ratajczak
    On a Conjecture Related to Geometric Routing. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:9-17 [Conf]
  61. Alexander Hall, Christos H. Papadimitriou
    Approximating the Distortion. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:111-122 [Conf]
  62. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    Scheduling Dags to Minimize Time and Communication. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:134-138 [Conf]
  63. Christos H. Papadimitriou
    The New Problems. [Citation Graph (0, 0)][DBLP]
    PCK50, 2003, pp:10- [Conf]
  64. Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough
    Topological Bandwidth. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:317-331 [Conf]
  65. Milena Mihail, Christos H. Papadimitriou
    On the Random Walk Method for Protocol Testing. [Citation Graph (0, 0)][DBLP]
    CAV, 1994, pp:132-141 [Conf]
  66. Christos H. Papadimitriou
    Planar Topological Queries. [Citation Graph (0, 0)][DBLP]
    CDB, 1997, pp:1-6 [Conf]
  67. Christos H. Papadimitriou
    The Complexity of Knowledge Representation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:244-248 [Conf]
  68. Christos H. Papadimitriou, John N. Tsitsiklis
    The Complexity of Optimal Queueing Network Control. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:318-322 [Conf]
  69. Christos H. Papadimitriou, Mihalis Yannakakis
    On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:12-18 [Conf]
  70. Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou
    On the Difficulty of Designing Good Classifiers. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:273-279 [Conf]
  71. Christos H. Papadimitriou
    Theoretical Problems Related to the Internet. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:1-2 [Conf]
  72. Christos H. Papadimitriou
    Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:1- [Conf]
  73. Christos H. Papadimitriou
    Learning the Internet. [Citation Graph (0, 0)][DBLP]
    COLT, 2002, pp:396- [Conf]
  74. Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri
    On the Optimal Bisection of a Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:198-202 [Conf]
  75. Joseph S. B. Mitchell, Christos H. Papadimitriou
    The Weighted Region Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:30-38 [Conf]
  76. Christos H. Papadimitriou
    Games Other People Play. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:5- [Conf]
  77. Gene Cheung, Steven McCanne, Christos H. Papadimitriou
    Software Synthesis of Variable-length Code Decoder Using a Mixture of Programmed Logic and Table Lookups. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:121-130 [Conf]
  78. Christos H. Papadimitriou
    Algorithmic Problems in Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2005, pp:1- [Conf]
  79. Konstantinos Daskalakis, Christos H. Papadimitriou
    The Complexity of Games on Highly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:71-82 [Conf]
  80. Christos H. Papadimitriou
    Computational Aspacts of Organization Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:559-564 [Conf]
  81. Christos H. Papadimitriou
    Games and Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:157- [Conf]
  82. Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
    How to Learn an Unknown Environment (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:298-303 [Conf]
  83. Xiaotie Deng, Christos H. Papadimitriou
    Exploring an Unknown Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:355-361 [Conf]
  84. Nikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani
    Market Equilibrium via a Primal-Dual-Type Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:389-395 [Conf]
  85. Deborah Goldman, Sorin Istrail, Christos H. Papadimitriou
    Algorithmic Aspects of Protein Structure Similarity. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:512-522 [Conf]
  86. Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou
    An Approximation Scheme for Planar Graph TSP. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:640-645 [Conf]
  87. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy Is Local Search? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:39-42 [Conf]
  88. Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker
    Optimization Problems in Congestion Control. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:66-74 [Conf]
  89. Richard M. Karp, Christos H. Papadimitriou
    On Linear Characterizations of Combinatorial Optimization Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:1-9 [Conf]
  90. Lefteris M. Kirousis, Christos H. Papadimitriou
    The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:175-185 [Conf]
  91. Elias Koutsoupias, Christos H. Papadimitriou
    Beyond Competitive Analysis [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:394-400 [Conf]
  92. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The Complexity of Searching a Graph (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:376-385 [Conf]
  93. Milena Mihail, Christos H. Papadimitriou, Amin Saberi
    On Certain Connectivity Properties of the Internet Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:28-35 [Conf]
  94. Christos H. Papadimitriou
    Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:4-8 [Conf]
  95. Christos H. Papadimitriou
    On the Complexity of Unique Solutions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:14-20 [Conf]
  96. Christos H. Papadimitriou
    Games Against Nature (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:446-450 [Conf]
  97. Christos H. Papadimitriou
    On Graph-Theoretic Lemmata and Complexity Classes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:794-801 [Conf]
  98. Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan, Hisao Tamaki
    Motion Planning on a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:511-520 [Conf]
  99. Christos H. Papadimitriou, Jeffrey D. Ullman
    A Communication-Time Tradeoff [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:84-88 [Conf]
  100. Christos H. Papadimitriou, David Wolfe
    The Complexity of Facets Resolved [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:74-78 [Conf]
  101. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Approximability of Trade-offs and Optimal Access of Web Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:86-92 [Conf]
  102. Christos H. Papadimitriou, Mihalis Yannakakis
    Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:358-363 [Conf]
  103. Christos H. Papadimitriou
    Shortest-Path Motion. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1986, pp:144-153 [Conf]
  104. Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri
    Designing Secure Communication Protocols from Trust Specifications. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:360-368 [Conf]
  105. Christos H. Papadimitriou
    Algorithmic problems related to the Internet. [Citation Graph (0, 0)][DBLP]
    HERCMA, 2001, pp:92- [Conf]
  106. Christos H. Papadimitriou
    Networks and Games. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:7- [Conf]
  107. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    The Complexity of Cubical Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:51-57 [Conf]
  108. Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou
    The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:513-524 [Conf]
  109. Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou
    Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:110-122 [Conf]
  110. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
    The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:346-357 [Conf]
  111. Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis
    Searching a Fixed Graph. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:280-289 [Conf]
  112. Harry R. Lewis, Christos H. Papadimitriou
    Symmetric Space-Bounded Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:374-384 [Conf]
  113. Christos H. Papadimitriou, Mihalis Yannakakis
    Shortest Paths Without a Map. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:610-620 [Conf]
  114. Christos H. Papadimitriou
    Algorithms, Games, and the Internet. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:1-3 [Conf]
  115. Christos H. Papadimitriou
    NP-Completeness: A Retrospective. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:2-6 [Conf]
  116. Christos H. Papadimitriou, Jon Louis Bentley
    A Worst-Case Analysis of Nearest Neighbor Searching by Projection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:470-482 [Conf]
  117. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:460-470 [Conf]
  118. Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
    Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:712-722 [Conf]
  119. Christos H. Papadimitriou
    Novel Computational Approaches to Information Retrieval and Data Mining (Abstract). [Citation Graph (0, 0)][DBLP]
    ICDT, 1999, pp:31- [Conf]
  120. Vladlen Koltun, Christos H. Papadimitriou
    Approximately Dominating Representatives. [Citation Graph (0, 0)][DBLP]
    ICDT, 2005, pp:204-214 [Conf]
  121. Xiaotie Deng, Christos H. Papadimitriou
    Competitive Distributed Decision-Making. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1992, pp:350-356 [Conf]
  122. Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, Bart Selman
    The Comparative Linguistics of Knowledge Representation. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:862-869 [Conf]
  123. Michelangelo Grigni, Dimitris Papadias, Christos H. Papadimitriou
    Topological Inference. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1995, pp:901-907 [Conf]
  124. Christos H. Papadimitriou
    Decision-Making with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:1- [Conf]
  125. Xiaotie Deng, Christos H. Papadimitriou
    Decision-Making by Hierarchies of Discordant Agents. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:183-192 [Conf]
  126. Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri
    On Horn Envelopes and Hypergraph Transversals. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:399-405 [Conf]
  127. Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan
    Optimal Information Delivery. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:181-187 [Conf]
  128. Christos H. Papadimitriou
    On certain rigorous approaches to data mining (invited talk, abstract only). [Citation Graph (0, 0)][DBLP]
    KDD, 2000, pp:2- [Conf]
  129. Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker
    Global Synchronization in Sensornets. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:609-624 [Conf]
  130. Christos H. Papadimitriou
    The Internet, the Web, and Algorithms. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:2- [Conf]
  131. Georg Gottlob, Christos H. Papadimitriou
    On the Complexity of Single-Rule Datalog Queries. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:201-222 [Conf]
  132. Ananth Rao, Christos H. Papadimitriou, Scott Shenker, Ion Stoica
    Geographic routing without location information. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2003, pp:96-108 [Conf]
  133. Foto N. Afrati, Christos H. Papadimitriou, Georgios I. Papadimitriou
    The Synthesis of Communication Protocols. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:263-271 [Conf]
  134. Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos H. Papadimitriou, John Kubiatowicz
    Selfish caching in distributed systems: a game-theoretic analysis. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:21-30 [Conf]
  135. Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker
    On a network creation game. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:347-351 [Conf]
  136. Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker
    A BGP-based mechanism for lowest-cost routing. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:173-182 [Conf]
  137. Christos H. Papadimitriou, Martha Sideri
    Optimal Coteries. [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:75-80 [Conf]
  138. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Value of Information in Distributed Decision-Making (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:61-64 [Conf]
  139. Serge Abiteboul, Gabriel M. Kuper, Christos H. Papadimitriou, Moshe Y. Vardi
    In Memoriam: Paris C. Kanellakis. [Citation Graph (0, 0)][DBLP]
    PODS, 1996, pp:79- [Conf]
  140. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan
    Auditing Boolean Attributes. [Citation Graph (0, 12)][DBLP]
    PODS, 2000, pp:86-91 [Conf]
  141. Christos H. Papadimitriou
    Database Metatheory: Asking the Big Queries. [Citation Graph (0, 8)][DBLP]
    PODS, 1995, pp:1-10 [Conf]
  142. Christos H. Papadimitriou, Mihalis Yannakakis
    Multiobjective Query Optimization. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  143. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Reliable Concurrency Control. [Citation Graph (0, 4)][DBLP]
    PODS, 1985, pp:230-234 [Conf]
  144. Milena Mihail, Christos H. Papadimitriou
    On the Eigenvalue Power Law. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:254-262 [Conf]
  145. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the complexity of protein folding (abstract). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:61-62 [Conf]
  146. Christos H. Papadimitriou
    Understanding the Internet. [Citation Graph (0, 0)][DBLP]
    SETN, 2002, pp:1-2 [Conf]
  147. Aditya Akella, Srinivasan Seshan, Richard M. Karp, Scott Shenker, Christos H. Papadimitriou
    Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 2002, pp:117-130 [Conf]
  148. Constantinos Daskalakis, Christos H. Papadimitriou
    Computing pure nash equilibria in graphical games via markov random fields. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2006, pp:91-99 [Conf]
  149. Aaron Archer, Christos H. Papadimitriou, Kunal Talwar, Éva Tardos
    An approximate truthful mechanism for combinatorial auctions with single parameter agents. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:205-214 [Conf]
  150. Christos H. Papadimitriou
    Game theory, algorithms, and the Internet. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:391- [Conf]
  151. Christos H. Papadimitriou, Tim Roughgarden
    Computing equilibria in multi-player games. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:82-91 [Conf]
  152. Christos H. Papadimitriou, Shmuel Safra
    The complexity of low-distortion embeddings between point sets. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:112-118 [Conf]
  153. Christos H. Papadimitriou, Martha Sideri
    The Bisection Width of Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:405-410 [Conf]
  154. Christos H. Papadimitriou
    Topological Queries. [Citation Graph (0, 0)][DBLP]
    SSD, 1999, pp:3-4 [Conf]
  155. Elias Koutsoupias, Christos H. Papadimitriou
    Worst-case Equilibria. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:404-413 [Conf]
  156. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Planar Map Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:514-523 [Conf]
  157. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:597-603 [Conf]
  158. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
    The complexity of computing a Nash equilibrium. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:71-78 [Conf]
  159. Xiaotie Deng, Christos H. Papadimitriou, Shmuel Safra
    On the complexity of equilibria. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:67-71 [Conf]
  160. Alex Fabrikant, Christos H. Papadimitriou, Kunal Talwar
    The complexity of pure Nash equilibria. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:604-612 [Conf]
  161. Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
    Sharing the cost of muliticast transmissions (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:218-227 [Conf]
  162. Paul W. Goldberg, Christos H. Papadimitriou
    Reducibility among equilibrium problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:61-70 [Conf]
  163. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan
    Segmentation Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:473-482 [Conf]
  164. Christos H. Papadimitriou
    Algorithms, games, and the internet. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:749-753 [Conf]
  165. Christos H. Papadimitriou, Mihalis Yannakakis
    Linear programming without the matrix. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:121-129 [Conf]
  166. Christos H. Papadimitriou
    The Joy of Theory. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:116- [Conf]
  167. Christos H. Papadimitriou
    Computing correlated equilibria in multi-player games. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:49-56 [Conf]
  168. Christos H. Papadimitriou, Michael Sipser
    Communication Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:196-200 [Conf]
  169. Christos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis
    On the Complexity of Local Search (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:438-445 [Conf]
  170. Christos H. Papadimitriou, Santosh Vempala
    On the approximability of the traveling salesman problem (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:126-133 [Conf]
  171. Christos H. Papadimitriou
    Theory of concurrency control. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:35-47 [Conf]
  172. Christos H. Papadimitriou, Stathis Zachos
    Two remarks on the power of counting. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:269-276 [Conf]
  173. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Panarity, Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:472-473 [Conf]
  174. Christos H. Papadimitriou
    ... The Interaction Between Algorithms and Game Theory. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:1-3 [Conf]
  175. Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri
    Experiments with an Economic Model of the Worldwide Web. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:46-54 [Conf]
  176. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
    A Note on Approximate Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:297-306 [Conf]
  177. Christos H. Papadimitriou
    Recent Developments in Equilibria Algorithms. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:1-2 [Conf]
  178. Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri
    An economic model of the worldwide web. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:934-935 [Conf]
  179. Christos H. Papadimitriou, Martha Sideri
    Default Theories that Always Have Extensions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:69, n:1-2, pp:347-357 [Journal]
  180. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    The Synthesis of Communication Protocols. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:451-472 [Journal]
  181. Xiaotie Deng, Christos H. Papadimitriou
    Competitive Distributed Decision-Making. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:133-150 [Journal]
  182. Christos H. Papadimitriou, P. Venkat Rangan, Martha Sideri
    Designing Secure Communication Protocols from Trust Specification. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:5, pp:485-499 [Journal]
  183. Christos H. Papadimitriou, Ellen B. Silverberg
    Optimal Piecewise Linear Motion of an Object Among Obstacles. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:523-539 [Journal]
  184. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Recognizing Hole-Free 4-Map Graphs in Cubic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:227-262 [Journal]
  185. Yannis Dimopoulos, Vangelis Magirou, Christos H. Papadimitriou
    On Kernels, Defaults and Even Graphs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:20, n:1-4, pp:1-12 [Journal]
  186. Dimitris J. Kavvadias, Christos H. Papadimitriou
    A Linear Programming Approach to Reasoning about Probabilities. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1990, v:1, n:, pp:- [Journal]
  187. Christos H. Papadimitriou, Santosh Vempala
    On The Approximability Of The Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:101-120 [Journal]
  188. Christos H. Papadimitriou, Mihalis Yannakakis
    On recognizing integer polyhedra. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:107-109 [Journal]
  189. Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan, Srihari Sampath Kumar
    Multimedia Information Caching for Personalized Video-on-Demand. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 1995, v:18, n:3, pp:204-216 [Journal]
  190. Goran Gogic, Christos H. Papadimitriou, Martha Sideri
    Incremental Recompilation of Knowledge [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  191. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Map Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  192. Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis
    Computing the Throughput of a Network with Dedicated Lines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:271-278 [Journal]
  193. Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker
    A BGP-based mechanism for lowest-cost routing. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:1, pp:61-72 [Journal]
  194. Christos H. Papadimitriou
    A note the expressive power of Prolog. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:26, n:, pp:21-22 [Journal]
  195. Paul W. Goldberg, Christos H. Papadimitriou
    Reducibility Among Equilibrium Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:090, pp:- [Journal]
  196. Konstantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
    The complexity of computing a Nash equilibrium [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:115, pp:- [Journal]
  197. Konstantinos Daskalakis, Christos H. Papadimitriou
    Three-Player Games Are Hard [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:139, pp:- [Journal]
  198. Serge Abiteboul, Christos H. Papadimitriou, Victor Vianu
    Reflective Relational Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:2, pp:110-136 [Journal]
  199. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    The Complexity of Cubical Graphs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:53-60 [Journal]
  200. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    Corrigendum: The Complexity of Cubical Graphs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:82, n:3, pp:350-353 [Journal]
  201. Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri
    Complexity Characterizations of Attribute Grammar Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:3, pp:178-186 [Journal]
  202. Georg Gottlob, Christos H. Papadimitriou
    On the complexity of single-rule datalog queries. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:104-122 [Journal]
  203. Christos H. Papadimitriou, John N. Tsitsiklis
    On the Complexity of Designing Distributed Protocols [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:53, n:3, pp:211-218 [Journal]
  204. Xanthippi Markenscoff, Luqun Ni, Christos H. Papadimitriou
    The Geometry of Grasping. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 1990, v:9, n:1, pp:61-74 [Journal]
  205. Xanthippi Markenscoff, Christos H. Papadimitriou
    Optimum Grip of a Polygon. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 1989, v:8, n:2, pp:17-29 [Journal]
  206. Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Testing Whether a Graph is a Superconcentrator. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:164-167 [Journal]
  207. Elias Koutsoupias, Christos H. Papadimitriou
    On the Greedy Algorithm for Satisfiability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:1, pp:53-55 [Journal]
  208. Elias Koutsoupias, Christos H. Papadimitriou
    The 2-Evader Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:5, pp:249-252 [Journal]
  209. Christos H. Papadimitriou
    Efficient Search for Rationals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:1, pp:1-4 [Journal]
  210. Christos H. Papadimitriou
    An Algorithm for Shortest-Path Motion in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:5, pp:259-263 [Journal]
  211. Christos H. Papadimitriou, Mihalis Yannakakis
    On Minimal Eulerian Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:203-205 [Journal]
  212. Christos H. Papadimitriou, Mihalis Yannakakis
    The Clique Problem for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:131-133 [Journal]
  213. Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou
    The Complexity of the Travelling Repairman Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:1, pp:79-87 [Journal]
  214. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Map graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:127-138 [Journal]
  215. Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou
    How to Learn an Unknown Environment I: The Rectilinear Case. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:2, pp:215-245 [Journal]
  216. Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas
    On a model of indexability and its bounds for range queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:1, pp:35-55 [Journal]
  217. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan
    Segmentation problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:263-280 [Journal]
  218. Elias Koutsoupias, Christos H. Papadimitriou
    On the k-Server Conjecture. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:5, pp:971-983 [Journal]
  219. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
    The complexity of searching a graph. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:1, pp:18-44 [Journal]
  220. Joseph S. B. Mitchell, Christos H. Papadimitriou
    The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1991, v:38, n:1, pp:18-73 [Journal]
  221. Christos H. Papadimitriou, Paris C. Kanellakis
    Flowshop scheduling with limited temporary storage. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:533-549 [Journal]
  222. Christos H. Papadimitriou, Mihalis Yannakakis
    The complexity of restricted spanning tree problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:285-309 [Journal]
  223. Christos H. Papadimitriou
    On the complexity of edge traversing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:544-554 [Journal]
  224. Christos H. Papadimitriou
    Optimality of the Fast Fourier transform. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:1, pp:95-102 [Journal]
  225. Goran Gogic, Christos H. Papadimitriou, Martha Sideri
    Incremental Recompilation of Knowledge. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1998, v:8, n:, pp:23-37 [Journal]
  226. Esther M. Arkin, Christos H. Papadimitriou
    On the Complexity of Circulations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:1, pp:134-145 [Journal]
  227. Ellen B. Feinberg, Christos H. Papadimitriou
    Finding Feasible Paths for a Two-Point Body. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:109-119 [Journal]
  228. George K. Georgakopoulos, Christos H. Papadimitriou
    The 1-Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:1, pp:122-130 [Journal]
  229. Christos H. Papadimitriou, Umesh V. Vazirani
    On Two Geometric Problems Related to the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:2, pp:231-246 [Journal]
  230. Michael D. Hirsch, Christos H. Papadimitriou, Stephen A. Vavasis
    Exponential lower bounds for finding Brouwer fix points. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:4, pp:379-416 [Journal]
  231. George F. Georgakopoulos, Dimitris J. Kavvadias, Christos H. Papadimitriou
    Probabilistic satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1988, v:4, n:1, pp:1-11 [Journal]
  232. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:423-466 [Journal]
  233. Richard Desper, Feng Jiang, Olli-P. Kallioniemi, Holger Moch, Christos H. Papadimitriou, Alejandro A. Schäffer
    Distance-Based Reconstruction of Tree Models for Oncogenesis. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:6, pp:789-803 [Journal]
  234. Richard Desper, Feng Jiang, Olli-P. Kallioniemi, Holger Moch, Christos H. Papadimitriou, Alejandro A. Schäffer
    Inferring Tree Models for Oncogenesis from Comparative Genome Hybridization Data. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1999, v:6, n:1, pp:37-52 [Journal]
  235. Pierluigi Crescenzi, Xiaotie Deng, Christos H. Papadimitriou
    On Approximating a Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:3, pp:287-297 [Journal]
  236. Xiaotie Deng, Christos H. Papadimitriou, Shmuel Safra
    On the complexity of price equilibria. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:311-324 [Journal]
  237. Joan Feigenbaum, Christos H. Papadimitriou, Scott Shenker
    Sharing the Cost of Multicast Transmissions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:1, pp:21-41 [Journal]
  238. Yannis E. Ioannidis, Christos H. Papadimitriou
    Special Issue on PODS 1999 - Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:3, pp:441-442 [Journal]
  239. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy is Local Search? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:79-100 [Journal]
  240. Lefteris M. Kirousis, Christos H. Papadimitriou
    The Complexity of Recognizing Polyhedral Scenes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:14-38 [Journal]
  241. Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan
    Auditing Boolean attributes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:244-253 [Journal]
  242. Milena Mihail, Christos H. Papadimitriou, Amin Saberi
    On certain connectivity properties of the internet topology. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:239-251 [Journal]
  243. Christos H. Papadimitriou
    Games Against Nature. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:2, pp:288-301 [Journal]
  244. Christos H. Papadimitriou
    On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:3, pp:498-532 [Journal]
  245. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala
    Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:217-235 [Journal]
  246. Christos H. Papadimitriou, Michael Sipser
    Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:260-269 [Journal]
  247. Christos H. Papadimitriou, Dan Suciu, Victor Vianu
    Topological Queries in Spatial Databases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:29-53 [Journal]
  248. Christos H. Papadimitriou, David Wolfe
    The Complexity of Facets Resolved. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:2-13 [Journal]
  249. Christos H. Papadimitriou, Mihalis Yannakakis
    Optimization, Approximation, and Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:425-440 [Journal]
  250. Christos H. Papadimitriou, Mihalis Yannakakis
    Tie-Breaking Semantics and Structural Totality. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:1, pp:48-60 [Journal]
  251. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Complexity of Database Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:407-427 [Journal]
  252. Christos H. Papadimitriou, Martha Sideri
    On the Floyd-Warshall Algorithm for Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:41, n:1, pp:129-137 [Journal]
  253. Christos H. Papadimitriou, Martha Sideri
    The Bisection Width of Grid Graphs. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:2, pp:97-110 [Journal]
  254. Stavros S. Cosmadakis, Christos H. Papadimitriou
    The Traveling Salesman Problem with Many Visits to Few Cities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:99-108 [Journal]
  255. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [Journal]
  256. Michelangelo Grigni, Vincent Mirelli, Christos H. Papadimitriou
    On the Difficulty of Designing Good Classifiers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:318-323 [Journal]
  257. Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh
    Covering Graphs by Simple Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:746-750 [Journal]
  258. Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter
    Hamilton Paths in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:676-686 [Journal]
  259. Paris C. Kanellakis, Christos H. Papadimitriou
    The Complexity of Distributed Concurrency Control. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:52-74 [Journal]
  260. Richard M. Karp, Christos H. Papadimitriou
    On Linear Characterizations of Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:620-632 [Journal]
  261. Elias Koutsoupias, Christos H. Papadimitriou
    Beyond Competitive Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:300-317 [Journal]
  262. Joseph S. B. Mitchell, David M. Mount, Christos H. Papadimitriou
    The Discrete Geodesic Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:647-668 [Journal]
  263. Christos H. Papadimitriou
    Worst-Case and Probabilistic Analysis of a Geometric Location Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:3, pp:542-557 [Journal]
  264. Christos H. Papadimitriou
    The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:450-465 [Journal]
  265. Christos H. Papadimitriou, Kenneth Steiglitz
    On the Complexity of Local Search for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:76-83 [Journal]
  266. Christos H. Papadimitriou, John N. Tsitsiklis
    On Stochastic Scheduling with In-Tree Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:1-6 [Journal]
  267. Christos H. Papadimitriou, Mihalis Yannakakis
    Scheduling Interval-Ordered Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:405-409 [Journal]
  268. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Reliable Concurrency Control. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:538-553 [Journal]
  269. Christos H. Papadimitriou, Mihalis Yannakakis
    Towards an Architecture-Independent Analysis of Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:322-328 [Journal]
  270. Kenneth A. Ross, Yannis E. Ioannidis, Anant Jhingran, Christos H. Papadimitriou
    Reminiscences on Influential Papers. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2000, v:29, n:4, pp:48-49 [Journal]
  271. Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis
    Deciding stability and mortality of piecewise affine dynamical systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:687-696 [Journal]
  272. Pierluigi Crescenzi, Christos H. Papadimitriou
    Reversible Simulation of Space-Bounded Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:159-165 [Journal]
  273. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
    A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  274. Lefteris M. Kirousis, Christos H. Papadimitriou
    Searching and Pebbling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:205-218 [Journal]
  275. Harry R. Lewis, Christos H. Papadimitriou
    Symmetric Space-Bounded Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:161-187 [Journal]
  276. Nimrod Megiddo, Christos H. Papadimitriou
    On Total Functions, Existence Theorems and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:317-324 [Journal]
  277. Christos H. Papadimitriou
    The Euclidean Traveling Salesman Problem is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:237-244 [Journal]
  278. Christos H. Papadimitriou, David Ratajczak
    On a conjecture related to geometric routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:3-14 [Journal]
  279. Christos H. Papadimitriou, Mihalis Yannakakis
    Shortest Paths Without a Map. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:1, pp:127-150 [Journal]
  280. Vladlen Koltun, Christos H. Papadimitriou
    Approximately dominating representatives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:371, n:3, pp:148-154 [Journal]
  281. Richard M. Karp, Scott Shenker, Christos H. Papadimitriou
    A simple algorithm for finding frequent elements in streams and bags. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2003, v:28, n:, pp:51-55 [Journal]
  282. Christos H. Papadimitriou, Philip A. Bernstein
    On the Performance of Balanced Hashing Functions When the Keys Are Not Equiprobable. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1980, v:2, n:1, pp:77-89 [Journal]
  283. Christos H. Papadimitriou
    Nash Equilibria: Where We Stand. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:1- [Conf]
  284. Moshe Babaioff, Robert Kleinberg, Christos H. Papadimitriou
    Congestion games with malicious players. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:103-112 [Conf]
  285. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
    Progress in approximate nash equilibria. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:355-358 [Conf]
  286. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
    The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  287. Constantinos Daskalakis, Christos H. Papadimitriou
    Computing Equilibria in Anonymous Games [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  288. Lefteris M. Kirousis, Christos H. Papadimitriou
    Interval graphs and seatching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:181-184 [Journal]

  289. Computing Equilibria in Anonymous Games. [Citation Graph (, )][DBLP]


  290. Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. [Citation Graph (, )][DBLP]


  291. On the Hardness of Being Truthful. [Citation Graph (, )][DBLP]


  292. Algorithmic Game Theory: A Snapshot. [Citation Graph (, )][DBLP]


  293. On a Network Generalization of the Minmax Theorem. [Citation Graph (, )][DBLP]


  294. On the Complexity of Reconfiguration Problems. [Citation Graph (, )][DBLP]


  295. Balancing traffic load in wireless networks with curveball routing. [Citation Graph (, )][DBLP]


  296. The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. [Citation Graph (, )][DBLP]


  297. Linked decompositions of networks and the power of choice in Polya urns. [Citation Graph (, )][DBLP]


  298. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. [Citation Graph (, )][DBLP]


  299. Inapproximability for VCG-Based Combinatorial Auctions. [Citation Graph (, )][DBLP]


  300. The myth of the folk theorem. [Citation Graph (, )][DBLP]


  301. On oblivious PTAS's for nash equilibrium. [Citation Graph (, )][DBLP]


  302. A Note on Strictly Competitive Games. [Citation Graph (, )][DBLP]


  303. Some Recent Results in Algorithmic Game Theory. [Citation Graph (, )][DBLP]


  304. Incentive-Compatible Interdomain Routing with Linear Utilities. [Citation Graph (, )][DBLP]


  305. The Computation of Equilibria. [Citation Graph (, )][DBLP]


  306. Mythematics: storytelling in the teaching of computer science and mathematics. [Citation Graph (, )][DBLP]


  307. The Search for Equilibrium Concepts. [Citation Graph (, )][DBLP]


  308. A New Look at Selfish Routing. [Citation Graph (, )][DBLP]


  309. The complexity of computing a Nash equilibrium. [Citation Graph (, )][DBLP]


  310. The NP-Completeness of the bandwidth minimization problem. [Citation Graph (, )][DBLP]


  311. Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games [Citation Graph (, )][DBLP]


  312. VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension [Citation Graph (, )][DBLP]


  313. Budget Feasible Mechanisms [Citation Graph (, )][DBLP]


  314. The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions [Citation Graph (, )][DBLP]


  315. The Myth of the Folk Theorem. [Citation Graph (, )][DBLP]


  316. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002