User profiles for "author:Christos Papadimitriou"

Christos H PAPADIMITRIOU

- Verified email at columbia.edu - Cited by 94758

Christos Papadimitriou

- Verified email at med.uoa.gr - Cited by 12310

Assessment of somatic k-RAS mutations as a mechanism associated with resistance to EGFR-targeted agents: a systematic review and meta-analysis of studies in …

H Linardou, IJ Dahabreh, D Kanaloupiti… - The lancet …, 2008 - thelancet.com
Background Somatic mutations of the k-RAS oncogene have been assessed as a
mechanism of de-novo resistance to epidermal growth factor receptor (EGFR) tyrosine …

Worst-case equilibria

E Koutsoupias, C Papadimitriou - Computer science review, 2009 - Elsevier
In a system where noncooperative agents share a common resource, we propose the price
of anarchy, which is the ratio between the worst possible Nash equilibrium and the social …

Interval scheduling: A survey

AWJ Kolen, JK Lenstra… - Naval Research …, 2007 - Wiley Online Library
In interval scheduling, not only the processing times of the jobs but also their starting times
are given. This article surveys the area of interval scheduling and presents proofs of results …

Computational complexity

CH Papadimitriou - Encyclopedia of computer science, 2003 - dl.acm.org
Once we have developed an algorithm (qv) for solving a computational problem and
analyzed its worst-case time requirements as a function of the size of its input (most usefully …

[BOOK][B] Combinatorial optimization: algorithms and complexity

CH Papadimitriou, K Steiglitz - 1998 - books.google.com
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of
the simplex method and also discusses the Soviet ellipsoid algorithm for linear …

[PDF][PDF] Elements of the Theory of Computation

HR Lewis, CH Papadimitriou - ACM SIGACT News, 1998 - dl.acm.org
This book is an introduction, on the undergraduate level, to the classical and contemporary
theor y of computation. The topics covered are, in a few words, the theory of automata and …

The complexity of computing a Nash equilibrium

C Daskalakis, PW Goldberg… - Communications of the …, 2009 - dl.acm.org
How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …

Worst-case equilibria

E Koutsoupias, C Papadimitriou - Annual symposium on theoretical …, 1999 - Springer
In a system in which noncooperative agents share a common resource, we propose the ratio
between the worst possible Nash equilibrium and the social optimum as a measure of the …

Optimization, approximation, and complexity classes

C Papadimitriou, M Yannakakis - … annual ACM symposium on Theory of …, 1988 - dl.acm.org
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are
classes of optimization problems, and in fact contain several natural, well-studied ones. We …

[PDF][PDF] Latent semantic indexing: A probabilistic analysis

CH Papadimitriou, H Tamaki, P Raghavan… - Proceedings of the …, 1998 - dl.acm.org
Latent semantic indexing (LX) is an information retrieval technique based on the spectral
analysis of the term-document matrix, whose empirical success had heretofort been without …