Christos Papadimitriou

From Wikipedia, the free encyclopedia

Christos Harilaos Papadimitriou (Greek: Χρίστος Χαριλάου Παπαδημητρίου) is a Professor in the Computer Science Division at the University of California, Berkeley, United States. He studied at the National Technical University of Athens (BS in Electrical Engineering, 1972) and at Princeton University (MS in Electrical Engineering, 1974 and PhD in Electrical Engineering and Computer Science, 1976). He has also taught at Harvard, MIT, the National Technical University of Athens, Stanford, and UCSD.

Papadimitriou is the author of the textbook Computational Complexity, one of the most widely used textbooks in the field of computational complexity theory.

In 2001 he was inducted as a Fellow of the Association for Computing Machinery and in 2002 he was awarded the Knuth Prize.

Chris also features among the top 100 computer science authors. His name, as of this writing is listed on the 19th position on the citeseer.

Contents 1 Interesting facts 2 Bibliography 3 External links 4 References

[edit] Interesting facts

• He co-authored a paper with Bill Gates, co-founder of Microsoft, while Gates was studying at Harvard.
• In 2006, he joined a professor-and-graduate-student band called Lady X and The Positive Eigenvalues.

[edit] Bibliography

• Elements of the theory of computation. (With Harry Lewis). Prentice-Hall, 1982; second edition September 1997.
• Combinatorial optimization: algorithms and complexity. (With Kenneth Steiglitz). Prentice-Hall 1982; second edition Dover, 1998.
• The theory of database concurrency control. CS Press, 1986.
• Computational Complexity. Addison Wesley, 1994.
• Turing (a Novel about Computation), MIT Press, November 2003.
• Life Sentence to Hackers? (in Greek), Kastaniotis Editions, 2004. A compilation of articles written for the greek newspaper To Vima.
• Algorithms (Coauthored with Sanjoy Dasgupta and Umesh Vazirani), McGraw-Hill, September 2006

[edit] External links

• Home page at Berkeley

[edit] References

• Gates W.H.; Papadimitriou, C.H. Bounds for sorting by prefix reversal. Discrete Math. 27 (1979), 47–57.