Christos Papadimitriou (original) (raw)
From Wikipedia, the free encyclopedia
Greek-American computer scientist (b. 1949)
| Christos Papadimitriou | |
|---|---|
 |
|
| Born | Christos Charilaos Papadimitriou (Greek: Χρήστος Χαρίλαος "Χρίστος" Παπαδημητρίου) (1949-08-16) August 16, 1949 (age 75)Athens |
| Education | National Technical University of Athens (MEng) Princeton University (PhD) |
| Awards | Von Neumann Medal (2016) EATCS Award (2015) Gödel Prize (2012) IEEE Computer Society Charles Babbage Award (2004) Knuth Prize (2002) |
| Scientific career | |
| Fields | Algorithms Complexity Game theory Education Evolution[1] |
| Institutions | University of California, Berkeley Columbia University[2] Harvard University MIT National Technical University of Athens Stanford University UCSD |
| Thesis | The Complexity of Combinatorial Optimization Problems (1976) |
| Doctoral advisor | Kenneth Steiglitz[3] |
| Doctoral students | Constantinos Daskalakis Paris Kanellakis Elias Koutsoupias Joseph Mitchell Christopher Umans |
| Website | www.cs.berkeley.edu/~christos |
Christos Charilaos Papadimitriou (Greek: Χρήστος Χαρίλαος "Χρίστος" Παπαδημητρίου; born August 16, 1949) is a Greek-American theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.[4][1][5][6][7][8]
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."[9]
Papadimitriou has taught at Harvard, MIT, the National Technical University of Athens, Stanford, UCSD, University of California, Berkeley and is currently the Donovan Family Professor of Computer Science at Columbia University.
Papadimitriou co-authored a paper on pancake sorting with Bill Gates, then a Harvard undergraduate. Papadimitriou recalled "Two years later, I called to tell him our paper had been accepted to a fine math journal. He sounded eminently disinterested. He had moved to Albuquerque, New Mexico to run a small company writing code for microprocessors, of all things. I remember thinking: 'Such a brilliant kid. What a waste.'" The company was Microsoft.[10]
Papadimitriou co-authored "The Complexity of Computing a Nash Equilibrium" with his students Constantinos Daskalakis and Paul W. Goldberg, for which they received the 2008 Kalai Game Theory and Computer Science Prize from the Game Theory Society for "the best paper at the interface of game theory and computer science",[11] in particular "for its key conceptual and technical contributions";[12] and the Outstanding Paper Prize from the Society for Industrial and Applied Mathematics.
In 2001, Papadimitriou was inducted as a Fellow of the Association for Computing Machinery and in 2002 he was awarded the Knuth Prize. Also in 2002, he became a member of the U.S. National Academy of Engineering for contributions to complexity theory, database theory, and combinatorial optimization.[13] In 2009 he was elected to the US National Academy of Sciences. During the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), there was a special event honoring Papadimitriou's contributions to computer science.[14] In 2012, he, along with Elias Koutsoupias, was awarded the Gödel Prize for their joint work on the concept of the price of anarchy.[15]
Papadimitriou is the author of the textbook Computational Complexity, one of the most widely used textbooks in the field of computational complexity theory. He has also co-authored the textbook Algorithms (2008) with Sanjoy Dasgupta and Umesh Vazirani, and the graphic novel Logicomix (2009)[16] with Apostolos Doxiadis.
His name was listed in the 19th position on the CiteSeer search engine academic database and digital library[_citation needed_].
In 1997, Papadimitriou received a doctorate honoris causa from the ETH Zurich.[17]
In 2011, Papadimitriou received a doctorate honoris causa from the National Technical University of Athens.[18]
In 2013, Papadimitriou received a doctorate honoris causa from the École polytechnique fédérale de Lausanne (EPFL).
Papadimitriou was awarded the IEEE John von Neumann Medal in 2016, the EATCS Award in 2015, the Gödel Prize in 2012, the IEEE Computer Society Charles Babbage Award in 2004, and the Knuth Prize in 2002. In 2019 he received the Harvey Prize of the Technion/Israel for the year 2018.[19]
- Elements of the Theory of Computation (with Harry R. Lewis). Prentice-Hall, 1982; second edition September 1997. greek edition
- 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 2008
- Logicomix, An Epic Search for Truth (coauthored with Apostolos Doxiadis, with artwork by Alecos Papadatos and Annie di Donna). Bloomsbury Publishing and Bloomsbury USA, September 2009.
- He co-authored a paper with Bill Gates, co-founder of Microsoft, on pancake sorting.[20]
At UC Berkeley, in 2006, he joined a professor-and-graduate-student band called Lady X and The Positive Eigenvalues.[21]
- ^ a b Christos Papadimitriou publications indexed by Google Scholar
- ^ "Columbia Faculty". Retrieved 2017-08-05.
- ^ Christos Papadimitriou at the Mathematics Genealogy Project
- ^ "Christos Papadimitriou". 24 May 2018.
- ^ Christos Papadimitriou author profile page at the ACM Digital Library
- ^ Ahmed, F (2014). "Profile of Christos Papadimitriou". Proceedings of the National Academy of Sciences. 111 (45): 15858–60. Bibcode:2014PNAS..11115858A. doi:10.1073/pnas.1405579111. PMC 4234580. PMID 25349396.
- ^ Christos H. Papadimitriou at DBLP Bibliography Server
- ^ Christos Papadimitriou's publications indexed by the Scopus bibliographic database. (subscription required)
- ^ "The complexity of combinatorial optimization problems". 1976.
- ^ "People of ACM — Christos Papadimitriou". People of ACM. Retrieved 2019-10-10.
- ^ "Game Theory Society: Named Lectures and Prizes". www.gametheorysociety.org. Retrieved 2020-01-19.
- ^ "Prize in Game Theory and Computer Science of the Game Theory Society (2008)" (PDF). Retrieved 2020-01-19.
- ^ "Member Directory at NAE Website". Retrieved 2017-07-22.
- ^ "Special Events: Honoring Christos Papadimitriou Scientific Contribution to Computer Science". ICALP 2009 – 36th International Colloquium on Automata, Languages and Programming. Archived from the original on March 6, 2012.
- ^ "Three Papers Cited for Laying Foundation of Growth in Algorithmic Game Theory". 16 May 2012. Archived from the original on 18 July 2013. Retrieved 16 May 2012.
- ^ Logicomix
- ^ "Honorary Doctorates, Department of Computer Science". Retrieved 2017-07-22.
- ^ "Live feed from the Award Ceremony of an honorary doctorate from the NTUA to the UC Berkeley Professor Chr. Papadimitriou". Archived from the original on 2016-03-03. Retrieved 2014-06-17.
- ^ Harvey Prize 2018
- ^ Gates, William H.; Papadimitriou, Christos H. (1979). "Bounds for sorting by prefix reversal". Discrete Mathematics. 27: 47–57. doi:10.1016/0012-365X(79)90068-2.
- ^ "Engineers rock — Out of the EECS department comes a hot new band". Archived from the original on May 31, 2013. Retrieved 2013-12-29.