A glimpse at Christos H. Papadimitriou

Christos H. Papadimitriou is one of the most influential and colorful researchers in Computer Science today. This glimpse is the outcome of a modest attempt of us to a biographical introduction to Christos, which we have drafted with extreme delight and honor.

[1]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[2]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[3]  Mihalis Yannakakis,et al.  Linear programming without the matrix , 1993, STOC.

[4]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[5]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[6]  Christos H. Papadimitriou,et al.  Mythematics: storytelling in the teaching of computer science and mathematics , 2003, ITiCSE '03.

[7]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

[8]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[9]  Xiaotie Deng,et al.  Competitive distributed decision-making , 1992, Algorithmica.

[10]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[11]  J. Nash.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[12]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[13]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[15]  S. Kakutani.  A generalization of Brouwer’s fixed point theorem , 1941 .

[16]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[17]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[18]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[19]  Christos H. Papadimitriou,et al.  On Two Geometric Problems Related to the Traveling Salesman Problem , 1984, J. Algorithms.

[20]  Christos H. Papadimitriou,et al.  Bounds for sorting by prefix reversal , 1979, Discret. Math..

[21]  L. Brouwer.  Über Abbildung von Mannigfaltigkeiten , 1911 .

[22]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[23]  C. Papadimitriou,et al.  Two remarks on the power of counting , 1983 .

[24]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[25]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[26]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[27]  Vikraman Arvind,et al.  Graph Isomorphism is in SPP , 2006, Inf. Comput..

[28]  Christos H. Papadimitriou,et al.  On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..

[29]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[30]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[31]  Christos H. Papadimitriou,et al.  The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..

[32]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[33]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.