Papadimitriou, Christos H.
Overview
Works:  62 works in 369 publications in 10 languages and 6,613 library holdings 

Genres:  Comic books, strips, etc Graphic novels Biographical fiction Textbooks Fiction Romance fiction Conference papers and proceedings Comics (Graphic works) History Nonfiction comics 
Roles:  Author, Editor, Creator, Author of introduction, Other 
Classifications:  PA5615.O87, 741.5 
Publication Timeline
.
Most widely held works by
Christos H Papadimitriou
Logicomix by
Apostolos K Doxiadēs(
Book
)
46 editions published between 2008 and 2018 in 8 languages and held by 1,636 WorldCat member libraries worldwide
This innovative, dramatic graphic novel recounts the spiritual odyssey of philosopher Bertrand Russell. In his agonized search for absolute truth, Russell crosses paths with legendary thinkers and finds a passionate student in the great Ludwig Wittgenstein
46 editions published between 2008 and 2018 in 8 languages and held by 1,636 WorldCat member libraries worldwide
This innovative, dramatic graphic novel recounts the spiritual odyssey of philosopher Bertrand Russell. In his agonized search for absolute truth, Russell crosses paths with legendary thinkers and finds a passionate student in the great Ludwig Wittgenstein
Elements of the theory of computation by
Harry R Lewis(
Book
)
40 editions published between 1981 and 1998 in English and Spanish and held by 1,201 WorldCat member libraries worldwide
Lewis and Papadimitriou present this long awaited Second Edition of their bestselling theory of computation. The authors are wellknown for their clear presentation that makes the material accessible to a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems
40 editions published between 1981 and 1998 in English and Spanish and held by 1,201 WorldCat member libraries worldwide
Lewis and Papadimitriou present this long awaited Second Edition of their bestselling theory of computation. The authors are wellknown for their clear presentation that makes the material accessible to a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems
Combinatorial optimization : algorithms and complexity by
Christos H Papadimitriou(
Book
)
46 editions published between 1982 and 2014 in English and Undetermined and held by 1,153 WorldCat member libraries worldwide
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering
46 editions published between 1982 and 2014 in English and Undetermined and held by 1,153 WorldCat member libraries worldwide
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering
Computational complexity by
Christos H Papadimitriou(
Book
)
36 editions published between 1993 and 2012 in 3 languages and held by 670 WorldCat member libraries worldwide
36 editions published between 1993 and 2012 in 3 languages and held by 670 WorldCat member libraries worldwide
Internet and network economics : 4th international workshop, WINE 2008, Shanghai, China, December 1720, 2008 ; proceedings by
David Hutchison(
)
18 editions published in 2008 in English and held by 508 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008, held in Shanghai, China, in December 2008. The 68 revised full papers presented together with 10 invited talks were carefully reviewed and selected from 126 submissions. The papers are organized in topical sections on market equilibrium, congestion games, information markets, nash equilibrium, network games, solution concepts, algorithms and optimization, mechanism design, equilibrium, online advertisement, sponsored search auctions, and voting problems
18 editions published in 2008 in English and held by 508 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 4th International Workshop on Internet and Network Economics, WINE 2008, held in Shanghai, China, in December 2008. The 68 revised full papers presented together with 10 invited talks were carefully reviewed and selected from 126 submissions. The papers are organized in topical sections on market equilibrium, congestion games, information markets, nash equilibrium, network games, solution concepts, algorithms and optimization, mechanism design, equilibrium, online advertisement, sponsored search auctions, and voting problems
Turing : a novel about computation by
Christos H Papadimitriou(
Book
)
19 editions published between 2003 and 2005 in English and held by 407 WorldCat member libraries worldwide
"Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a successful computer executive, Alexandros, a melancholy archaeologist, and Ian, a charismatic hacker. After Ethel (who shares her first name with Alan Turing's mother) abandons Alexandros following a sundrenched idyll on Corfu, Turing appears on Alexandros's computer screen to unfurl a tutorial on the history of ideas. He begins with the philosophermathematicians of ancient Greece  "discourse, dialogue, argument, proof ... can only thrive in an egalitarian society"And the Arab scholar in ninthcentury Baghdad who invented algorithms; he moves on to many other topics, including cryptography and artificial intelligence, even economics and developmental biology. (These lessons are later critiqued amusingly and developed further in postings by a fictional newsgroup in the book's afterword.) As Turing's lectures progress, the lives of Alexandros, Ethel, and Ian converge in dramatic fashion, and the story takes us from Corfu to Hong Kong, from Athens to San Francisco  and of course to the Internet, the disruptive technological and social force that emerges as the main locale and protagonist of the novel."
19 editions published between 2003 and 2005 in English and held by 407 WorldCat member libraries worldwide
"Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a successful computer executive, Alexandros, a melancholy archaeologist, and Ian, a charismatic hacker. After Ethel (who shares her first name with Alan Turing's mother) abandons Alexandros following a sundrenched idyll on Corfu, Turing appears on Alexandros's computer screen to unfurl a tutorial on the history of ideas. He begins with the philosophermathematicians of ancient Greece  "discourse, dialogue, argument, proof ... can only thrive in an egalitarian society"And the Arab scholar in ninthcentury Baghdad who invented algorithms; he moves on to many other topics, including cryptography and artificial intelligence, even economics and developmental biology. (These lessons are later critiqued amusingly and developed further in postings by a fictional newsgroup in the book's afterword.) As Turing's lectures progress, the lives of Alexandros, Ethel, and Ian converge in dramatic fashion, and the story takes us from Corfu to Hong Kong, from Athens to San Francisco  and of course to the Internet, the disruptive technological and social force that emerges as the main locale and protagonist of the novel."
Algorithms by
Sanjoy Dasgupta(
Book
)
17 editions published between 2006 and 2016 in English and held by 314 WorldCat member libraries worldwide
This text, extensively classtested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard onesemester course, but can be covered in an advanced algorithms course or in a more leisurely twosemester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. "Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University
17 editions published between 2006 and 2016 in English and held by 314 WorldCat member libraries worldwide
This text, extensively classtested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include:The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard onesemester course, but can be covered in an advanced algorithms course or in a more leisurely twosemester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center. "Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University
The theory of database concurrency control by
Christos H Papadimitriou(
Book
)
7 editions published in 1986 in English and held by 304 WorldCat member libraries worldwide
7 editions published in 1986 in English and held by 304 WorldCat member libraries worldwide
Kurt Gödel and the foundations of mathematics : horizons of truth by
Matthias Baaz(
)
5 editions published between 2011 and 2014 in English and held by 122 WorldCat member libraries worldwide
This volume commemorates the life, work and foundational views of Kurt Gödel (19061978), most famous for his hallmark works on the completeness of firstorder logic, the incompleteness of number theory, and the consistency  with the other widely accepted axioms of set theory  of the axiom of choice and of the generalized continuum hypothesis. It explores current research, advances and ideas for future directions not only in the foundations of mathematics and logic, but also in the fields of computer science, artificial intelligence, physics, cosmology, philosophy, theology and the history of science. The discussion is supplemented by personal reflections from several scholars who knew Gödel personally, providing some interesting insights into his life. By putting his ideas and life's work into the context of current thinking and perceptions, this book will extend the impact of Gödel's fundamental work in mathematics, logic, philosophy and other disciplines for future generations of researchers
5 editions published between 2011 and 2014 in English and held by 122 WorldCat member libraries worldwide
This volume commemorates the life, work and foundational views of Kurt Gödel (19061978), most famous for his hallmark works on the completeness of firstorder logic, the incompleteness of number theory, and the consistency  with the other widely accepted axioms of set theory  of the axiom of choice and of the generalized continuum hypothesis. It explores current research, advances and ideas for future directions not only in the foundations of mathematics and logic, but also in the fields of computer science, artificial intelligence, physics, cosmology, philosophy, theology and the history of science. The discussion is supplemented by personal reflections from several scholars who knew Gödel personally, providing some interesting insights into his life. By putting his ideas and life's work into the context of current thinking and perceptions, this book will extend the impact of Gödel's fundamental work in mathematics, logic, philosophy and other disciplines for future generations of researchers
Logicómix : una búsqueda épica de la verdad by
Apostolos K Doxiadēs(
Book
)
7 editions published between 2011 and 2014 in Spanish and held by 30 WorldCat member libraries worldwide
This innovative, dramatic graphic novel recounts the spiritual odyssey of philosopher Bertrand Russell. In his agonized search for absolute truth, Russell crosses paths with legendary thinkers and finds a passionate student in the great Ludwig Wittgenstein
7 editions published between 2011 and 2014 in Spanish and held by 30 WorldCat member libraries worldwide
This innovative, dramatic graphic novel recounts the spiritual odyssey of philosopher Bertrand Russell. In his agonized search for absolute truth, Russell crosses paths with legendary thinkers and finds a passionate student in the great Ludwig Wittgenstein
An optimality theory of concurrency control for databases by
H. T Kung(
Book
)
11 editions published between 1979 and 1980 in English and held by 19 WorldCat member libraries worldwide
A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e., the amount of parallelism that it supports, depends explicitly upon the amount of information that is available to the scheduler. We point out that most previous work on concurrency control is simply concerned with specific points of the base tradeoff between performance and information. In fact, several of these approaches are shown to be optimal for the amount of information that they use. (Author)
11 editions published between 1979 and 1980 in English and held by 19 WorldCat member libraries worldwide
A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e., the amount of parallelism that it supports, depends explicitly upon the amount of information that is available to the scheduler. We point out that most previous work on concurrency control is simply concerned with specific points of the base tradeoff between performance and information. In fact, several of these approaches are shown to be optimal for the amount of information that they use. (Author)
Logicomix eine epische Suche nach Wahrheit by
Apostolos K Doxiadēs(
Book
)
2 editions published in 2012 in German and held by 15 WorldCat member libraries worldwide
2 editions published in 2012 in German and held by 15 WorldCat member libraries worldwide
Optimum grip of a polygon by
X Markenscoff(
Book
)
4 editions published in 1987 in English and held by 13 WorldCat member libraries worldwide
4 editions published in 1987 in English and held by 13 WorldCat member libraries worldwide
Kombinatornaja optimizacija : algoritmy i složnostʹ by
Christos H Papadimitriou(
Book
)
4 editions published in 1985 in Russian and Undetermined and held by 12 WorldCat member libraries worldwide
4 editions published in 1985 in Russian and Undetermined and held by 12 WorldCat member libraries worldwide
Algorithmic game theory(
Book
)
3 editions published between 2007 and 2013 in English and held by 10 WorldCat member libraries worldwide
With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application
3 editions published between 2007 and 2013 in English and held by 10 WorldCat member libraries worldwide
With contributions from major researchers in the field, 'Algorithmic Game Theory' presents a comprehensive treatment of this important practical application
Serializability of concurrent database updates by
Christos H Papadimitriou(
Book
)
5 editions published in 1979 in English and held by 9 WorldCat member libraries worldwide
A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NPcomplete problem. We therefore introduce several efficiently recognizable subclasses of the class of serializable histories; most of these subclasses correspond to serializability principles existing in the literature and used in practice. We also propose two new principles which subsume all previously known ones. We give necessary and sufficient conditions for a class of histories to be the output of an efficient history scheduler; these conditions imply that there can be no efficient scheduler that outputs all of serializable histories, and also that all subclasses of serializable histories studied above have an efficient scheduler. Finally, we show how our results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. (Author)
5 editions published in 1979 in English and held by 9 WorldCat member libraries worldwide
A sequence of interleaved user transactions in a database system may not be serializable, i.e., equivalent to some sequential execution of the individual transactions. Using a simple transaction model we show that recognizing the transaction histories which are serializable is an NPcomplete problem. We therefore introduce several efficiently recognizable subclasses of the class of serializable histories; most of these subclasses correspond to serializability principles existing in the literature and used in practice. We also propose two new principles which subsume all previously known ones. We give necessary and sufficient conditions for a class of histories to be the output of an efficient history scheduler; these conditions imply that there can be no efficient scheduler that outputs all of serializable histories, and also that all subclasses of serializable histories studied above have an efficient scheduler. Finally, we show how our results can be extended to far more general transaction models, to transactions with partly interpreted functions, and to distributed database systems. (Author)
On kernels, defaults and even graphs by
Yannis Dimopoulos(
Book
)
4 editions published in 1993 in English and German and held by 9 WorldCat member libraries worldwide
The algorithm empirically performs well for quite large theories."
4 editions published in 1993 in English and German and held by 9 WorldCat member libraries worldwide
The algorithm empirically performs well for quite large theories."
The traveling salesman problem with many visits to few cities by Stavros S Cosmadakis(
Book
)
3 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
Intractable problems in control theory by
Christos H Papadimitriou(
Book
)
5 editions published between 1984 and 1986 in English and Undetermined and held by 9 WorldCat member libraries worldwide
5 editions published between 1984 and 1986 in English and Undetermined and held by 9 WorldCat member libraries worldwide
On the complexity of integer programming by
Christos H Papadimitriou(
Book
)
3 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Doxiadēs, Apostolos K. 1953 Scenarist Author Creator
 Papadatos, Alekos Illustrator Author Creator
 Di Donna, Annie Artist
 Russell, Bertrand 18721970
 Lewis, Harry R. Author
 Steiglitz, Kenneth 1939
 Zhang, Shuzhong Other Editor
 Turing, Alan 19121954
 Vazirani, Umesh Virkumar
 Dasgupta, Sanjoy Author
Useful Links
Associated Subjects
Algorithms Biographical fiction Combinatorial analysis Combinatorial optimization Comic books, strips, etc Computational complexity Computer algorithms Computer networks Computer networksEconomic aspects ComputersAccess control Computer science Computer scientists Computer simulation Control theory Database management Econometrics Electronic commerce Formal languages Game theory Gödel, Kurt Gödel's theorem Graphic novels Great Britain Greece Influence (Literary, artistic, etc.) Information storage and retrieval systems Integer programming Internet InternetEconomic aspects Logic, Symbolic and mathematical Logicians Logic programming Machine theory Mathematical optimization Mathematicians Mathematics MathematicsComputer programs MathematicsPhilosophy Parallel processing (Electronic computers) Philosophers Polygons Programming (Mathematics) Programming languages (Electronic computers) Recursive functions Russell, Bertrand, Traveling salesman problem Turing, Alan Mathison,
Covers
Alternative Names
A DOXIADIS
Christos Papadimitriou computer scientist
Christos Papadimitriou griechischer Informatiker
Christos Papadimitriou Grieks schrijver
Papadēmētriu, Christos 1949
Papadēmētriu, Christos Ch 1949
Papadēmētriu, Christos Charilau 1949
Papadimitrij, Ch 1949
Papadimitriou, C.
Papadimitriou, C. 1949
Papadimitriou, C. (Christos)
Papadimitriou, C. (Christos), 1949
Papadimitriou, C. H. 1949
Papadimitriou, Christos
Papadimitriou, Christos 1949
Papadimitriou, Christos Charilaos
Papadimitriou, Christos Charilaos 1949
Papadimitriou, Christos H.
Papadimitriou, Christos H. 1949
Papadimitriou, Christos Harilaos 1949
Papadimitriou, Christos M. 1949
Papadimitriu, Ch.
Papadimitriu, Christos.
Papadimitriu, H.
Παπαδημητρίου, Χρίστος Χ. 1949
Χρήστος Παπαδημητρίου
Пападимитриу, Х.
Пападимитриу, Христос
Христос Пападімітріу
כריסטוס פאפאדימיטריו
פפדימיטריו, כריסטוס ח.
کریستوس پاپادیمیتریو نویسنده، ریاضیدان، و دانشمند علوم کامپیوتر یونانی
크리스토스 파파디미트리우
クリストス・パパディミトリュー
赫里斯托斯·帕帕季米特里乌
Languages