Survey: A glimpse at Christos H. Papadimitriou

Authors:
Marios Mavronicolas;Paul G. Spirakis
Affiliations:
Department of Computer Science, University of Cyprus, CY-1678 Nicosia, Cyprus;Department of Computer Engineering and Informatics, University of Patras, Rion, 26500 Patras, Greece and Research Academic Computer Technology Institute, P. O. Box 1122, 26110 Patras, Greece
Venue:
Computer Science Review
Year:
2009

Citing 21
Cited 0

Games against nature

Journal of Computer and System Sciences
How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Shortest paths without a map

Theoretical Computer Science
On selecting a satisfying truth assignment (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem

SIAM Journal on Computing
IP = PSPACE

Journal of the ACM (JACM)
Linear programming without the matrix

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the k-server conjecture

Journal of the ACM (JACM)
How to learn an unknown environment. I: the rectilinear case

Journal of the ACM (JACM)
The serializability of concurrent database updates

Journal of the ACM (JACM)
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Two remarks on the power of counting

Proceedings of the 6th GI-Conference on Theoretical Computer Science
Mythematics: storytelling in the teaching of computer science and mathematics

Proceedings of the 8th annual conference on Innovation and technology in computer science education
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On The Approximability Of The Traveling Salesman Problem

Combinatorica
Undirected connectivity in log-space

Journal of the ACM (JACM)
Exploring an unknown graph

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Graph Isomorphism is in SPP

Information and Computation
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.