Papadimitriou, Christos
Overview
Works:  9 works in 17 publications in 3 languages and 32 library holdings 

Roles:  Author 
Classifications:  QA267, 511 
Publication Timeline
.
Most widely held works by
Christos Papadimitriou
Segmentation problems by
Jon Kleinberg(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We introduce and study a novel genre of optimization problems, which we call segmentation problems. Our motivation, in part, is the development of a framework for evaluating certain data mining and clustering operations in terms of their utility in decisionmaking. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. This framework contains a number of standard combinatorial clustering problems as special cases, and many segmentation problems turn out to be MAXSNPcomplete even when the corresponding 'unsegmented' version is easy to solve. We develop approximation algorithms for two natural and interesting problems in this class  the hypercube segmentation problem and the catalog segmentation problem  and present a general greedy scheme, which can be specialized to approximate a large class of segmentation problems. Finally, we indicate some connections to local search, game theory, and sensitivity analysis in linear programming."
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We introduce and study a novel genre of optimization problems, which we call segmentation problems. Our motivation, in part, is the development of a framework for evaluating certain data mining and clustering operations in terms of their utility in decisionmaking. For any classical optimization problem, the corresponding segmentation problem seeks to partition a set of cost vectors into several segments, so that the overall cost is optimized. This framework contains a number of standard combinatorial clustering problems as special cases, and many segmentation problems turn out to be MAXSNPcomplete even when the corresponding 'unsegmented' version is easy to solve. We develop approximation algorithms for two natural and interesting problems in this class  the hypercube segmentation problem and the catalog segmentation problem  and present a general greedy scheme, which can be specialized to approximate a large class of segmentation problems. Finally, we indicate some connections to local search, game theory, and sensitivity analysis in linear programming."
The theory of database concurrency control by
Christos H Papadimitriou(
Book
)
2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide
The complexity of combinatorial optimization problems by
Christos Ch Papadēmētriou(
Book
)
3 editions published in 1976 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 1976 in English and held by 3 WorldCat member libraries worldwide
Elements of the theory of computation by
Harry R Lewis(
Book
)
2 editions published between 1992 and 2005 in Greek, Modern and held by 2 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
2 editions published between 1992 and 2005 in Greek, Modern and held by 2 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
To chamogelo tou Touringk by
Christos Ch Papadēmētriou(
Book
)
1 edition published in 2000 in Greek, Modern and held by 1 WorldCat member library worldwide
1 edition published in 2000 in Greek, Modern and held by 1 WorldCat member library worldwide
Algoritmos by
Sanjoy Dasgupta(
Book
)
3 editions published between 2000 and 2010 in Portuguese and English and held by 1 WorldCat member library worldwide
3 editions published between 2000 and 2010 in Portuguese and English and held by 1 WorldCat member library worldwide
Touringk : mathēmata agapēs by
Christos Ch Papadēmētriou(
Book
)
1 edition published in 2003 in Greek, Modern and held by 1 WorldCat member library worldwide
1 edition published in 2003 in Greek, Modern and held by 1 WorldCat member library worldwide
The complerity of combinatorial optimization problems by
Christos Ch Papadēmētriou(
)
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
1 edition published in 1977 in English and held by 1 WorldCat member library worldwide
Quantum Information Processing(
)
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
This effort supported a Quantum Information Workshop at the University of California, Berkeley. After a cut in funding, the remaining unspent funding was used to support: (I) research related to the internet involving the interplay between mechanism design and computational complexity, (2) improved understanding of the connections between phase transitions in statistical mechanics and mixing times of Markov chain Monte Carlo algorithms, and (3) an investigation of the logic of transcriptional control of various model organisms, with emphasis on characterizing the binding sites of key transcription factors via stochastic models
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
This effort supported a Quantum Information Workshop at the University of California, Berkeley. After a cut in funding, the remaining unspent funding was used to support: (I) research related to the internet involving the interplay between mechanism design and computational complexity, (2) improved understanding of the connections between phase transitions in statistical mechanics and mixing times of Markov chain Monte Carlo algorithms, and (3) an investigation of the logic of transcriptional control of various model organisms, with emphasis on characterizing the binding sites of key transcription factors via stochastic models
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Algorithms Computational complexity Computer science Database management Database searching Formal languages Logic, Symbolic and mathematical Machine theory Mathematical optimization Multimedia systems Parallel processing (Electronic computers) Programming languages (Electronic computers) Recursive functions
Alternative Names
Papadēmētriou, Christos Ch
Papadimitriou, Christos
Papadimitriou Christos 1949....
Papadīmītríou, Chrī́stos Ch 1949...
Papadimitriou, Christos Charilaos
Papadimitriou, Christos H.
Παπαδημητρίου Χρῆστος Χ. 1949....
Παπαδημητριου, Χριστος Χ.
Παπαδημητρίου Χρίστος Χ. 1949....
파파디미트리오우, 크리스토스
파파디미트리우, 크리스토스
파파디미트리우, 크리스토스 H
Languages