Christos Papadimitriou | Academic Influence

Christos Papadimitriou's AcademicInfluence.com Rankings

Christos Papadimitriou

Computer Science

#115

World Rank

#121

Historical Rank

Theoretical Computer Science

#12

World Rank

#12

Historical Rank

Database

#28

World Rank

#29

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Christos Papadimitriou's Degrees

PhD Electrical Engineering and Computer Science Princeton University
Masters Electrical Engineering Princeton University

Why Is Christos Papadimitriou Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University. Education Papadimitriou studied at the National Technical University of Athens, where in 1972 he received his Bachelor of Arts degree in electrical engineering. He then pursued graduate studies at Princeton University, where he received his Ph.D. in electrical engineering and computer science in 1976 after completing a doctoral dissertation titled "The complexity of combinatorial optimization problems."

(See a Problem?)

Christos Papadimitriou's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Combinatorial Optimization: Algorithms and Complexity (1981) (7471)
Worst-case Equilibria (1999) (2472)
Optimization, approximation, and complexity classes (1991) (1895)
The Complexity of Markov Decision Processes (1987) (1473)
Algorithms, games, and the internet (2001) (1191)
The complexity of computing a Nash equilibrium (2006) (1107)
Latent semantic indexing: a probabilistic analysis (1998) (1102)
Elements of the Theory of Computation (1997) (1065)
The serializability of concurrent database updates (1979) (1009)
Geographic routing without location information (2003) (924)
On Generating All Maximal Independent Sets (1988) (833)
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence (1994) (728)
How easy is local search? (1985) (726)
The Euclidean Traveling Salesman Problem is NP-Complete (1977) (710)
The Discrete Geodesic Problem (1987) (706)
The complexity of pure Nash equilibria (2004) (661)
The Complexity of Multiterminal Cuts (1994) (653)
Computational complexity (1993) (648)
On the Complexity of Cooperative Solution Concepts (1994) (601)
Shortest Paths Without a Map (1989) (555)
A simple algorithm for finding frequent elements in streams and bags (2003) (555)
On a network creation game (2003) (547)
Free-riding and whitewashing in peer-to-peer systems (2004) (531)
On the complexity of integer programming (1981) (519)
Towards an architecture-independent analysis of parallel algorithms (1990) (519)
On the approximability of trade-offs and optimal access of Web sources (2000) (496)
On the Complexity of Protein Folding (1998) (481)
Hamilton Paths in Grid Graphs (1982) (477)
Games against nature (1985) (477)
The complexity of computing a Nash equilibrium (2009) (464)
The Theory of Database Concurrency Control (1986) (462)
The Complexity of Optimal Queuing Network Control (1999) (453)
Sharing the Cost of Multicast Transmissions (2001) (451)
A BGP-based mechanism for lowest-cost routing (2002) (439)
The Geometry of Grasping (1990) (427)
The Complexity of Coloring Circular Arcs and Chords (1980) (425)
The Traveling Salesman Problem with Distances One and Two (1993) (423)
The complexity of searching a graph (1981) (396)
The complexity of facets (and some facets of complexity) (1982) (389)
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet (2002) (368)
Latent Semantic Indexing (2000) (345)
The weighted region problem: finding shortest paths through a weighted planar subdivision (1991) (340)
Inclusion dependencies and their interaction with functional dependencies (1982) (338)
Computing correlated equilibria in multi-player games (2005) (316)
On the k-server conjecture (1995) (310)
Searching and Pebbling (1986) (304)
Bounds for sorting by prefix reversal (1979) (299)
On selecting a satisfying truth assignment (1991) (294)
Exploring an unknown graph (1990) (283)
The complexity of optimal queueing network control (1994) (274)
An approximate truthful mechanism for combinatorial auctions with single parameter agents (2003) (267)
On Total Functions, Existence Theorems and Computational Complexity (1991) (261)
The NP-Completeness of the bandwidth minimization problem (1976) (261)
Two remarks on the power of counting (1983) (245)
Flowshop scheduling with limited temporary storage (1980) (242)
An Algorithm for Shortest-Path Motion in Three Dimensions (1985) (238)
Scheduling Interval-Ordered Tasks (1979) (233)
The complexity of multiway cuts (extended abstract) (1992) (233)
Strategic Classification (2015) (232)
On the complexity of reconfiguration problems (2008) (228)
The complexity of facets resolved (1985) (226)
Interval scheduling: A survey (2007) (225)
Cycles in adversarial regularized learning (2017) (221)
A Microeconomic View of Data Mining (1998) (220)
On limited nondeterminism and the complexity of the V-C dimension (1993) (219)
On the Complexity of Database Queries (1999) (213)
Beyond competitive analysis [on-line algorithms] (1994) (206)
Market equilibrium via a primal--dual algorithm for a convex program (2008) (206)
Intractable problems in control theory (1985) (204)
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search (2002) (199)
Optimum Grip of a Polygon (1987) (197)
On a conjecture related to geometric routing (2004) (193)
Selfish caching in distributed systems: a game-theoretic analysis (2004) (193)
Updates of Relational Views (1984) (191)
On linear characterizations of combinatorial optimization problems (1980) (189)
Segmentation problems (1998) (186)
A note on approximate Nash equilibria (2006) (186)
Why not negation by fixpoint? (1988) (183)
On The Approximability Of The Traveling Salesman Problem (2006) (182)
Topological Inference (1995) (182)
A Note on Succinct Representations of Graphs (1986) (182)
The complexity of the capacitated tree problem (1978) (181)
Algorithmic aspects of protein structure similarity (1999) (180)
Market equilibrium via a primal-dual-type algorithm (2002) (177)
Three-Player Games Are Hard (2005) (170)
On the Eigenvalue Power Law (2002) (166)
How to learn an unknown environment. I: the rectilinear case (1998) (163)
The complexity of recognizing polyhedral scenes (1985) (161)
The complexity of restricted spanning tree problems (1982) (160)
On certain connectivity properties of the Internet topology (2003) (158)
On the analysis of indexing schemes (1997) (158)
Symmetric Space-Bounded Computation (1982) (156)
On the complexity of edge traversing (1976) (154)
On Concurrency Control by Multiple Versions (1982) (153)
Worst-Case and Probabilistic Analysis of a Geometric Location Problem (1981) (152)
On the Hardness of Being Truthful (2008) (151)
How to learn an unknown environment (1991) (148)
The Complexity of the Travelling Repairman Problem (1986) (146)
Exponential lower bounds for finding Brouwer fixed points (1987) (146)
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (2006) (145)
Auditing Boolean attributes (2000) (144)
On Two Geometric Problems Related to the Traveling Salesman Problem (1984) (140)
Progress in approximate nash equilibria (2007) (138)
Reducibility among equilibrium problems (2006) (135)
Local Search for the Asymmetric Traveling Salesman Problem (1980) (135)
The Comparative Linguistics of Knowledge Representation (1995) (134)
On the complexity of equilibria (2002) (134)
Interval graphs and seatching (1985) (131)
Balancing traffic load in wireless networks with curveball routing (2007) (130)
An approximation scheme for planar graph TSP (1995) (126)
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP (2002) (126)
Algorithmic Game Theory: The Complexity of Finding Nash Equilibria (2007) (122)
An optimality theory of concurrency control for databases (1979) (121)
Multiobjective query optimization (2001) (120)
Approximately dominating representatives (2005) (118)
Topological queries in spatial databases (1996) (115)
Computing correlated equilibria in multi-player games (2008) (114)
Linear programming without the matrix (1993) (113)
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case) (1978) (113)
Probabilistic satisfiability (1988) (112)
Computing equilibria in multi-player games (2005) (112)
Computing Equilibria in Anonymous Games (2007) (108)
Optimum Statistical Estimation with Strategic Data Sources (2014) (106)
Congestion games with malicious players (2007) (106)
On complexity as bounded rationality (extended abstract) (1994) (105)
Searching a Fixed Graph (1996) (104)
On the complexity of local search (1990) (102)
Algorithms, games, and evolution (2014) (100)
On the Complexity of Local Search for the Traveling Salesman Problem (1977) (98)
On the complexity of unique solutions (1982) (98)
A Communication-Time Tradeoff (1984) (97)
Selfish behavior and stability of the internet: a game-theoretic analysis of TCP (2002) (96)
A mixability theory for the role of sex in evolution (2008) (94)
On the Greedy Algorithm for Satisfiability (1992) (93)
The myth of the folk theorem (2008) (92)
The Complexity of Testing Whether a Graph is a Superconcentrator (1981) (90)
The Complexity of Computing a (2009) (90)
Continuous local search (2011) (90)
The adjacency relation on the traveling salesman polytope is NP-Complete (1978) (89)
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond (2008) (84)
Optimization problems in congestion control (2000) (83)
A note the expressive power of Prolog (1985) (83)
α-Rank: Multi-Agent Evaluation by Evolution (2019) (81)
The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem (1992) (81)
On Horn Envelopes and Hypergraph Transversals (1993) (80)
NP-Completeness: A Retrospective (1997) (79)
Map graphs (1999) (78)
Locking policies: Safety and freedom from deadlock (1979) (78)
Some Examples of Difficult Traveling Salesman Problems (1978) (78)
The complexity of massive data set computations (2002) (77)
Computing pure nash equilibria in graphical games via markov random fields (2006) (77)
On optimal single-item auctions (2010) (75)
Topological Bandwidth (1983) (74)
On oblivious PTAS's for nash equilibrium (2009) (73)
Deciding stability and mortality of piecewise affine dynamical systems (2001) (73)
The even-path problem for graphs and digraphs (1984) (72)
Learning and verifying quantified boolean queries by example (2013) (72)
Sharing the cost of muliticast transmissions (preliminary version) (2000) (71)
On a model of indexability and its bounds for range queries (2002) (70)
Motion planning on a graph (1994) (69)
On the predictability of coupled automata: an allegory about chaos (1990) (69)
Elements of the theory of computation, 2nd Edition (1998) (67)
Communication complexity (1982) (65)
The Clique Problem for Planar Graphs (1981) (64)
Sex, mixability, and modularity (2010) (63)
On platers with a bounded number of states (1992) (63)
On the value of private information (2001) (63)
On Stochastic Scheduling with In-Tree Precedence Constraints (1987) (62)
On the complexity of price equilibria (2003) (60)
Algebraic Dependencies (Extended Abstract) (1980) (60)
Some computational aspects of circumscription (1988) (60)
Algebraic dependencies (1980) (59)
The weighted region problem (1987) (58)
Information caching for delivery of personalized video programs on home entertainment channels (1994) (57)
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (2006) (57)
Some complexity results for the Traveling Salesman Problem (1976) (57)
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems (1981) (57)
On the complexity of database queries (extended abstract) (1997) (57)
Global Synchronization in Sensornets (2004) (56)
The parallel complexity of simple chain queries (1987) (55)
Brain computation by assemblies of neurons (2019) (54)
On Learning Algorithms for Nash Equilibria (2010) (54)
Zero-Sum Polymatrix Games: A Generalization of Minmax (2016) (53)
On the complexity of single-rule datalog queries (1999) (53)
On a Network Generalization of the Minmax Theorem (2009) (53)
On the complexity of protein folding (extended abstract) (1998) (52)
Inapproximability for VCG-based combinatorial auctions (2010) (52)
Approximate Nash equilibria in anonymous games (2015) (52)
Mechanisms for complement-free procurement (2011) (52)
SERIALIZABILITY OF CONCURRENT DATA BASE UPDATES (1979) (51)
On the value of information in distributed decision-making (extended abstract) (1991) (51)
Covering Graphs by Simple Circuits (1981) (50)
Multimedia Information Caching for Personalized Video-on-Demand (1995) (50)
The Efficiency of Algorithms. (1978) (50)
Alan and I (2012) (50)
On the Complexity of Designing Distributed Protocols (1982) (49)
A note on strategy elimination in bimatrix games (1988) (49)
Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games (2008) (49)
On Approximating a Scheduling Problem (2001) (49)
On the Random Walk Method for Protocol Testing (1994) (48)
On the Complexity of Dynamic Mechanism Design (2014) (48)
Planar map graphs (1998) (48)
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions (2010) (47)
Incremental Recompilation of Knowledge (1997) (46)
Simultaneous bayesian auctions and computational complexity (2014) (46)
Theory of concurrency control (1983) (44)
An Axiomatic Approach to Block Rewards (2019) (44)
The Traveling Salesman Problem with Many Visits to Few Cities (1984) (42)
Optimality of the Fast Fourier transform (1979) (41)
Efficient Search for Rationals (1979) (41)
The bisection width of grid graphs (1990) (41)
On the approximability of the traveling salesman problem (extended abstract) (2000) (41)
The Complexity of Fairness Through Equilibrium (2013) (40)
From Nash Equilibria to Chain Recurrent Sets: Solution Concepts and Topology (2016) (40)
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions (2015) (39)
The complexity of low-distortion embeddings between point sets (2005) (38)
Game dynamics as the meaning of a game (2019) (38)
On graph-theoretic lemmata and complexity classes (1990) (37)
A linear programming approach to reasoning about probabilities (1990) (37)
On the Value of Information (1996) (35)
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) (1983) (33)
Modularity of cycles and paths in graphs (1991) (33)
Algorithmic aspects of multiversion concurrency control (1985) (33)
When the Players Are Not Expectation Maximizers (2010) (32)
Games Against Nature (Extended Abstract) (1983) (32)
On the Floyd-Warshall Algorithm for Logic Programs (1999) (31)
The performance of a precedence-based queuing discipline (1986) (31)
Recognizing Hole-Free 4-Map Graphs in Cubic Time (2006) (31)
Concurrency Control by Locking (1983) (31)
Tie-breaking semantics and structural totality (1992) (31)
A Game-Theoretic Analysis of Games with a Purpose (2008) (30)
Optimization, Approximation, and Complexity Classes (Extended Abstract) (1988) (30)
A New Look at Selfish Routing (2010) (30)
On recognizing integer polyhedra (1990) (30)
The Complexity of Games on Highly Regular Graphs (2005) (30)
A Worst-Case Analysis of Nearest Neighbor Searching by Projection (1980) (29)
Scheduling Dags to Minimize Time and Communication (1988) (29)
On the complexity of protein folding (abstract) (1998) (29)
Does Information Revelation Improve Revenue? (2016) (29)
A simple criterion for structurally fixed modes (1984) (28)
Computational Aspacts of Organization Theory (Extended Abstract) (1996) (28)
Can Almost Everybody be Almost Happy? (2015) (28)
Multiplicative updates in coordination games and the theory of evolution (2012) (27)
Towards a Unified Complexity Theory of Total Functions (2017) (27)
MythematiCS: in praise of storytelling in the teaching of computer science and math (2003) (27)
A Note on Strictly Competitive Games (2009) (27)
Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983) (27)
Default Theories that Always Have Extensions (1994) (26)
Modeling Social Networks through User Background and Behavior (2011) (26)
Database metatheory: asking the big queries (1995) (26)
Computational aspects of organization theory (1996) (25)
The parallel complexity of simple logic programs (1993) (25)
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory (2018) (25)
The Complexity of Cubical Graphs (1985) (25)
The complexity of distributed concurrency control (1981) (25)
Game theory and mathematical economics: a theoretical computer scientist's introduction (2001) (25)
Approximability and completeness in the polynomial hierarchy (2000) (25)
Energy Equilibria in Proof-of-Work Mining (2019) (24)
On Inefficient Proofs of Existence and Complexity Classes (1992) (24)
Random Projection in the Brain and Computation with Assemblies of Neurons (2019) (24)
A theorem in database concurrency control (1982) (23)
On Simplex Pivoting Rules and Complexity Theory (2014) (22)
Efficiency-Revenue Trade-Offs in Auctions (2012) (22)
Approximating the Distortion (2005) (22)
Sparse covers for sums of indicators (2013) (22)
Updaies of relational views (1983) (22)
Understanding the Internet (2002) (21)
Satisfiability and Evolution (2013) (21)
Algorithms, complexity, and the sciences (2014) (21)
Proceedings of the 32nd annual symposium on Foundations of computer science (1991) (21)
The complexity of nash equilibria (2008) (19)
Kurt Godel and the Foundations of Mathematics: Horizons Of Truth (2014) (19)
On the k-server conjecture (1994) (19)
The complexity of combinatorial optimization problems. (1976) (19)
The Complexity of Searching a Graph (Preliminary Version) (1981) (19)
Logicomix: An Epic Search for Truth (2008) (18)
Optimal coteries (1991) (18)
Towards an analysis of indexing schemes (1997) (18)
The synthesis of communication protocols (1986) (18)
Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities (2021) (18)
Reversible Simulation of Space-Bounded Computations (1995) (18)
The power of reflective relational machines (1994) (17)
Sex as an algorithm (2016) (17)
Long Term Memory and the Densest K-Subgraph Problem (2018) (17)
On kernels, defaults and even graphs (1997) (17)
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games (2018) (17)
Cortical Learning via Prediction (2015) (16)
Optimal Strategies of Blotto Games: Beyond Convexity (2019) (16)
Internet and Network Economics (2008) (16)
The complexity of knowledge representation (1996) (15)
The complexity of fairness through equilibrium (2014) (15)
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons (2018) (15)
ON GRAPH-THEORETIC LEMMATA AND COMPLEXITY CLASSES (Extended Abstract ) (1990) (15)
The Origins of the Deadline: Optimizing Communication in Organizations (2004) (15)
On Finding Extensions of Default Theories (1992) (15)
EXPLORING AN UNKNOWN GRAPH (Extended Abstract) (1990) (14)
Is distributed locking harder? (1982) (14)
Mythematics: storytelling in the teaching of computer science and mathematics (2003) (14)
On the Convergence of Query Evaluation (1989) (13)
Motion Planning on a Graph (Extended Abstract) (1994) (13)
The Complexity of Pure Nash Equilibria (Extended Abstract) (2004) (13)
Assembly pointers for variable binding in networks of spiking neurons (2016) (13)
An impossibility theorem for price-adjustment mechanisms (2010) (13)
Emerging opportunities for theoretical computer science (1997) (13)
On the Optimal Bisection of a Polygon (1992) (13)
Algorithms, Games, and the Internet (Extended Abstract) (2001) (13)
Self-Attention Networks Can Process Bounded Hierarchical Languages (2021) (13)
Convergence of sideways query evaluation (1985) (13)
Reflective Relational Machines (1998) (13)
alpha-Rank: Multi-Agent Evaluation by Evolution (2019) (12)
Decision-making by hierarchies of discordant agents (1997) (12)
On the Complexity of Circulations (1986) (12)
Learning the Internet (2002) (11)
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria (2019) (11)
Software synthesis of variable-length code decoder using a mixture of programmed logic and table lookups (1999) (11)
Polytopes and Complexity (1984) (11)
Optimal piecewise linear motion of an object among obstacles (1987) (11)
The Optimum Execution Order of Queries in Linear Storage (1990) (11)
On negative cycles in mixed graphs (1985) (10)
Evolution and Learning: Used Together, Fused Together. A Response to Watson and Szathmáry. (2016) (10)
How Easy Is Local Search? (Extended Abstract) (1985) (10)
Turing - a novel about computation (2003) (10)
Wealth Inequality and the Price of Anarchy (2018) (10)
Public Goods Games in Directed Networks (2021) (10)
Reductions in PPP (2019) (9)
STDP Forms Associations between Memory Traces in Networks of Spiking Neurons (2018) (9)
Worst-case ration for planar graphs and the method of induction on faces (1981) (9)
Optimizing the diamond lane: A more tractable carpool problem and algorithms (2016) (9)
Algorithmic aspects of protein folding and protein structure similarity (2000) (9)
Shortest-Path Motion (1986) (9)
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (1979) (9)
Brain Computation: A Computer Science Perspective (2019) (9)
A Model for Structured Information Representation in Neural Networks of the Brain (2016) (9)
Economies with non-convex production and complexity equilibria (2011) (9)
Optimal Information Delivery (1995) (9)
On Satisfiability Problems with a Linear Structure (2016) (8)
ON THE COMPLEXITY OF LOCAL SEARCH (Extended Abstract) (1990) (8)
Symmetric Space-Bounded Computation (Extended Abstract) (1980) (8)
Games and Networks (2003) (8)
Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash (2015) (8)
An analytical contrast between fitness maximization and selection for mixability. (2011) (8)
Incremental recompilation of knowledge (extended abstract) (1994) (7)
Optimal deterministic auctions with correlated priors (2010) (7)
Associations between memory traces emerge in a generic neural circuit model through STDP (2017) (7)
Incentive-Compatible Interdomain Routing with Linear Utilities (2007) (7)
On the Difficulty of Designing Good Classifiers (1996) (7)
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension (2009) (7)
Finding Feasible Paths for a Two-Point Body (1989) (7)
The future of computational complexity theory: part I (1996) (7)
The Search for Equilibrium Concepts (2008) (6)
Total Functions in the Polynomial Hierarchy (2020) (6)
Game theory, algorithms, and the Internet (2001) (6)
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (1999) (6)
The complexity of reliable concurrency control (1985) (6)
Vector Analysis of Threshold Functions (1995) (6)
Computing the Throughput of a Network with Dedicated Lines (1993) (6)
On the power of locking (1981) (6)
Maximizing throughput of reliable bulk network transmissions (1997) (5)
Competitive distributed decision-making (1992) (5)
Linked decompositions of networks and the power of choice in Polya urns (2008) (5)
Comment on “Computing Correlated Equilibria in Multi-Player Games” (2010) (5)
On the Computational Complexity of Limit Cycles in Dynamical Systems (2015) (5)
The Complexity of Computing Equilibria (2015) (5)
Assemblies of neurons can learn to classify well-separated distributions (2021) (5)
The Web Graph as an Equilibrium (2015) (5)
Proceedings of the 4th International Workshop on Internet and Network Economics (2008) (5)
Topological Queries (1999) (4)
Mathematical programming: complexity and applications (1989) (4)
Networks and Games (2004) (4)
Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis (2018) (4)
An economic model of the worldwide web (2005) (4)
Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) (1981) (4)
On concurrency control by multiple versions (1982) (4)
Experiments with an Economic Model of the Worldwide Web (2005) (4)
Improved Tradeoff-based Models of the Internet (2007) (3)
Cortical Computation via Iterative Constructions (2016) (3)
THE COMPLEXITY OF OPTIMAL QUEUING NETWORK CONTROL1 (1999) (3)
The Computation of Equilibria (2007) (3)
A Biologically Plausible Parser (2021) (3)
Cortical Computation (2015) (3)
Complexity Characterizations of Attribute Grammar Languages (1987) (3)
The New Faces of Combinatorial Optimization (2012) (3)
TFNP: An Update (2017) (3)
Correction to "A Theorem in Database Concurrency Control" (1985) (3)
Complexity of Efficiency-Revenue Trade-offs in Bayesian Auctions (2011) (3)
On Selecting a Satisfying Truth Assignment (Extended Abstract) (1991) (3)
On Minimal Eulerian Graphs (1981) (3)
A Multiplayer Generalization of the MinMax Theorem (2014) (3)
Horizons of Truth (2011) (3)
The Intractability of Dynamic Mechanism Design (2014) (3)
The Joy of Theory (2002) (3)
Complexity aspects of knowledge representation (1996) (2)
Power-Law Distributions in a Two-Sided Market and Net Neutrality (2016) (2)
Towards a theory of indexability (1997) (2)
Corrigendum: The Complexity of Cubical Graphs (1989) (2)
Selfish Routers and the Price of Anarchy (2008) (2)
Communities and reputation on the web (2002) (2)
Assembly projections support the assignment of thematic roles to concepts in networks of spiking neurons (2016) (2)
Planar Topological Inference (Algorithms and Theory of Computing) (1998) (2)
Algorithmic Problems in Ad Hoc Networks (2005) (2)
Recent Developments in Equilibria Algorithms (2005) (2)
ErgasÐa-Episkìphsh dhmosÐeushc : Computing Equilibria in Multi-player Games (2007) (2)
Turing ’ s Imitation Game : a discussion with the benefit of hindsight (2004) (2)
Comparing Trade-off Based Models of the Internet (2009) (2)
On the optimality of grid cells (2016) (2)
ON HORN ENVELOPES AND HYPERGRAPH TRANSVERSALS ( Extended Abstract for ISAAC ) (1993) (2)
Planar Topological Queries (1997) (2)
Book Collection 1981 : Elements of the theory of computation / Harry R. (1981) (2)
PROBLEM SET #3 (1999) (2)
Biologically Plausible Neural Networks via Evolutionary Dynamics and Dopaminergic Plasticity (2019) (2)
Algorithmic Game Theory: A Snapshot (2009) (2)
Games, algorithms, and the Internet (2011) (2)
On the performance of balanced hashing functions when the keys are not equiprobable (1980) (2)
On path lengths modulo three (1991) (2)
The Platform Design Problem (2020) (1)
Sex: The power of randomization. (2019) (1)
Database metatheory: asking the big queries (1995) (1)
Novel Computational Approaches to Information Retrieval and Data Mining (Abstract) (1999) (1)
On Extroverted Complexity Theory (2007) (1)
Complexity of game dynamics (2008) (1)
Variable Binding through Assemblies in Spiking Neural Networks (2016) (1)
8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA (2017) (1)
On the stochastic scheduling of a tree (1985) (1)
The throughput of a precedence-based queuing discipline (1985) (1)
The Power of Re ective Relational MachinesS (1994) (1)
Logical Hygiene, Foundations, and Abstractions: Diversity among Aspects and Options (2011) (1)
Communication in hierarchies: explaining deadlines (2000) (1)
Theoretical Problems Related to the Internet (2000) (1)
Combinatorial Auctions : VC v . VCG (2008) (1)
Kurt Gödel and the Foundations of Mathematics: Computation and Intractability: Echoes of Kurt Gödel (2011) (1)
On the optimal bisection of a polygon (extended abstract) (1990) (1)
Panarity, Revisited (Extended Abstract) (1997) (1)
Unsupervised Learning through Prediction in a Model of Cortex (2014) (1)
... The Interaction Between Algorithms and Game Theory (2005) (1)
The new problems (2003) (1)
SOME CONPLEXiT¥ ~ES~ILTS FOR THE TNAVELING SALESMAN PROBLEMS (2000) (0)
Special Issue on PODS 1999 - Guest Editors' Foreword (2002) (0)
On Neural Networks and Paul Spirakis (2015) (0)
Computational complexity in the life sciences (invited talk) (1998) (0)
Optimal Coteries on a Network (1992) (0)
Incentive-Compatible Interdomain Routing with Linear Utilities (2008) (0)
Cs294-1 Algorithmic Aspects of Game Theory 4.1 Overview 4.2 Social Choice Theory (2003) (0)
Computability and Complexity Jon Kleinberg (0)
Front Matter, Table of Contents, Preface, Conference Organization (2017) (0)
A New Age of Computing and the Brain (2014) (0)
Stathis Zachos at 70! (2017) (0)
Approximation Algorithms for SegmentationProblems (1998) (0)
The Daniel H. Wagner Prize for Excellence in Operations Research Practice (1999) (0)
Revenue maximization in online auctions (2005) (0)
An Analyzer for Message Sequence Charts 15 Lemma 4.1 the Timed M S C M Is Timing Inconsistent I the Graph G M 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (0)
Some notes on streaming algorithms – continued (0)
Dynamic Programming 6.1 Shortest Paths in Dags, Revisited (0)
Computational complexity of generalized graph coloring problems (1988) (0)
OF KNOWLEDGE (Extended Abstract) (1994) (0)
Designing secure communication protocols from trust specifications (1991) (0)
The EATCS Award 2019 - Call for Nominations (2018) (0)
The ACM PODS Alberto O. Mendelzon test-of-time-award 2009 (2009) (0)
Algorithms, Games, and Evolution (Invited Talk) (2014) (0)
The Complexity of Cubical Graphs (Extended Abstract) (1984) (0)
Kurt Gödel and the Foundations of Mathematics: Preface (2011) (0)
Elements of the theory of computation / Harry R. Lewis, Christos H. Papadimitriou (1998) (0)
Algorithmic Aspects of Game Theory Spring 2001 Lecture 2 : January 23 (2012) (0)
Afterword: From the Newsgroup (2005) (0)
An Analyzer for Message Sequence Charts 15 Acknowledgements: We Thank 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (1996) (0)
Editorial on the Electronic Notes in Theoretical Computer Science (1995) (0)
Quantum Information Processing (2004) (0)
N C ] 1 1 N ov 2 01 6 Assembly pointers for variable binding in networks of spiking neurons (2016) (0)
Database Theory Column Database Metatheory: Asking the Big Queries (1995) (0)
Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) (2021) (0)
Turing's Test (2005) (0)
UNICATION-TIME TRADEOFFt (1984) (0)
A Calculus for Brain Computation (2019) (0)
Some Recent Results in Algorithmic Game Theory (2008) (0)
Algorithmic Approaches to Information Retrieval and Data Mining (Abstract) (1998) (0)
Decision-Making with Incomplete Information (1991) (0)
Continuous local search Citation (2010) (0)
An Algorithmic View of the Universe (2012) (0)
31 : 2 Wealth Inequality and the Price of Anarchy (2019) (0)
The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) (1985) (0)
Optimal Scheduling of the Leaves of a Tree and the SVO Frequencies of Languages (2022) (0)
Geometric embeddings, geometric algorithms, and combinatorial optimization (2006) (0)
Algorithmic Game Theory: Foreword (2007) (0)
Computation as a Scientific Weltanschauung (Invited Talk) (2016) (0)
Grigni: [7] Topological Inference (0)
Internet routing and internet service provision (2009) (0)
5 Preliminary Simulation Results (2011) (0)
Papers about papers. (2008) (0)
Bayesian Online Matching: Approximating the Optimal Online Algorithm (2021) (0)
Discrete Algorithms for Mobile and Wireless Networks Lecture 8 Part B : Thursday , 8 th February 2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian 1 Lecture topic (2007) (0)
Congestion Games : Allocating Bandwidth (2003) (0)
Hide-and-Seek (2005) (0)
On certain rigorous approaches to data mining (invited talk) (abstract only) (2000) (0)
Cs294-1 Algorithmic Aspects of Game Theory 2.1 Overview 2.2 Sperner's Lemma (2003) (0)
Games Other People Play (2005) (0)
Design and Analysis of Algorithms Following Algorithms (2016) (0)
Understanding evolution through algorithms (2016) (0)
The Internet, the Web, and Algorithms (2002) (0)
Some additional notes on Max Flow and Min Cut 1 Flows and Cuts in Networks (2016) (0)
Ian and Turing (2005) (0)
The EATCS Award 2017 - Laudatio for Eva Tardos (2017) (0)
Nash Equilibria: Where We Stand (2007) (0)
Kurt Gödel and the Foundations of Mathematics: Short Biography of Kurt Gödel (2011) (0)
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points (2022) (0)
Algorithmic problems related to the Internet (2001) (0)
About Place Cells and Grid Cells - About Place Cells and Grid Cells (2018) (0)

This paper list is powered by the following services:

Other Resources About Christos Papadimitriou

en.wikipedia.org

What Schools Are Affiliated With Christos Papadimitriou?

Christos Papadimitriou is affiliated with the following schools:

Image Attributions

Image Source for Christos Papadimitriou