BibSLEIGH — Christos_H

Travelled to:

1 × Austria
1 × Belgium
1 × France
1 × Germany
1 × United Kingdom
2 × Spain
29 × USA
3 × Italy
5 × Canada
5 × Greece

Collaborated with:

M.Yannakakis ∅ C.Daskalakis P.C.Kanellakis A.Fabrikant E.Koutsoupias F.N.Afrati P.Raghavan P.W.Goldberg G.Pierrakos P.G.Kolaitis S.Vempala S.S.Cosmadakis J.M.Kleinberg V.Vianu S.Abiteboul J.M.Hellerstein M.Mihail G.Papageorgiou T.Hadzilacos M.Sipser H.R.Lewis J.L.Bentley H.T.Kung K.Steiglitz K.Talwar X.Deng S.Safra J.Feigenbaum S.Shenker Z.Chen M.Grigni D.Suciu A.A.Schäffer M.A.Casanova R.Fagin I.Diakonikolas Y.Singer P.Gopalan E.N.Maneva H.Tamaki G.M.Kuper M.Y.Vardi A.Abouzied D.Angluin A.Silberschatz P.Crescenzi D.Goldman A.Piccolboni E.Dahlhaus D.S.Johnson P.D.Seymour C.Borgs J.T.Chayes N.Immorlica A.T.Kalai V.S.Mirrokni A.Roussou Y.Sagiv J.D.Ullman

Talks about:

complex (18) queri (7) game (6) algorithm (5) problem (5) comput (5) optim (5) equilibria (4) databas (4) control (4)

Person: Christos H. Papadimitriou

DBLP: Papadimitriou:Christos_H=

Facilitated 2 volumes:

Contributed to:

2013

2012

2011

2009

2008

2006

2005

2004

2003

2002

2001

2000

1998

1997

1996

1995

1994

1993

1992

1990

1989

1988

1987

1986

1985

1984

1983

1982

1981

1980

1979

1976

Wrote 64 papers:

PODS-2013-AbouziedAPHS #learning #quantifier #query #verification: Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.
ICALP-v2-2012-DiakonikolasPPS #trade-off: Efficiency-Revenue Trade-Offs in Auctions (ID, CHP, GP, YS), pp. 488–499.
STOC-2011-PapadimitriouP #on the: On optimal single-item auctions (CHP, GP), pp. 119–128.
ICALP-v1-2009-Papadimitriou #algorithm #game studies: Algorithmic Game Theory: A Snapshot (CHP), pp. 3–11.
ICALP-v2-2009-DaskalakisP #network #on the #theorem: On a Network Generalization of the Minmax Theorem (CD, CHP), pp. 423–434.
STOC-2009-DaskalakisP #equilibrium #nash #on the: On oblivious PTAS’s for nash equilibrium (CD, CHP), pp. 75–84.
STOC-2008-BorgsCIKMP #theorem: The myth of the folk theorem (CB, JTC, NI, ATK, VSM, CHP), pp. 365–372.
ICALP-v1-2006-DaskalakisFP #complexity #game studies #nash: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.
ICALP-v1-2006-GopalanKMP #satisfiability: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (PG, PGK, ENM, CHP), pp. 346–357.
STOC-2006-DaskalakisGP #complexity #equilibrium #nash: The complexity of computing a Nash equilibrium (CD, PWG, CHP), pp. 71–78.
STOC-2006-GoldbergP #equilibrium #problem: Reducibility among equilibrium problems (PWG, CHP), pp. 61–70.
STOC-2005-Papadimitriou #correlation #game studies #multi: Computing correlated equilibria in multi-player games (CHP), pp. 49–56.
STOC-2004-FabrikantPT #complexity #nash: The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.
ITiCSE-2003-Papadimitriou #education #named: Mythematics: storytelling in the teaching of computer science and mathematics (CHP), p. 1.
ICALP-2002-FabrikantKP #internet #paradigm #trade-off: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet (AF, EK, CHP), pp. 110–122.
STOC-2002-DengPS #complexity #on the: On the complexity of equilibria (XD, CHP, SS), pp. 67–71.
STOC-2002-Papadimitriou: The Joy of Theory (CHP), p. 116.
ICALP-2001-Papadimitriou #algorithm #game studies #internet: Algorithms, Games, and the Internet (CHP), pp. 1–3.
PODS-2001-PapadimitriouY #multi #optimisation #query: Multiobjective Query Optimization (CHP, MY).
STOC-2001-Papadimitriou #algorithm #game studies #internet: Algorithms, games, and the internet (CHP), pp. 749–753.
KDD-2000-Papadimitriou #data mining #mining #on the: On certain rigorous approaches to data mining (CHP), p. 2.
PODS-2000-KleinbergPR: Auditing Boolean Attributes (JMK, CHP, PR), pp. 86–91.
STOC-2000-FeigenbaumPS #cost analysis #low cost: Sharing the cost of muliticast transmissions (JF, CHP, SS), pp. 218–227.
STOC-2000-PapadimitriouV #on the #problem: On the approximability of the traveling salesman problem (CHP, SV), pp. 126–133.
PODS-1998-PapadimitriouRTV #analysis #probability #semantics: Latent Semantic Indexing: A Probabilistic Analysis (CHP, PR, HT, SV), pp. 159–168.
STOC-1998-ChenGP #graph: Planar Map Graphs (ZZC, MG, CHP), pp. 514–523.
STOC-1998-CrescenziGPPY #complexity #on the: On the Complexity of Protein Folding (PC, DG, CHP, AP, MY), pp. 597–603.
STOC-1998-KleinbergPR #problem #segmentation: Segmentation Problems (JMK, CHP, PR), pp. 473–482.
ICALP-1997-Papadimitriou #named: NP-Completeness: A Retrospective (CHP), pp. 2–6.
PODS-1997-HellersteinKP #analysis #on the: On the Analysis of Indexing Schemes (JMH, EK, CHP), pp. 249–256.
PODS-1997-PapadimitriouY #complexity #database #on the #query: On the Complexity of Database Queries (CHP, MY), pp. 12–19.
ICALP-1996-KoutsoupiasPY #graph: Searching a Fixed Graph (EK, CHP, MY), pp. 280–289.
PODS-1996-AbiteboulKPV: In Memoriam: Paris C. Kanellakis (SA, GMK, CHP, MYV), p. 79.
PODS-1996-PapadimitriouSV #database #query: Topological Queries in Spatial Databases (CHP, DS, VV), pp. 81–92.
PODS-1995-Papadimitriou #database #query: Database Metatheory: Asking the Big Queries (CHP), pp. 1–10.
CAV-1994-MihailP #on the #protocol #random #testing: On the Random Walk Method for Protocol Testing (MM, CHP), pp. 132–141.
LICS-1994-AbiteboulPV #power of #relational: The Power of Reflective Relational Machines (SA, CHP, VV), pp. 230–240.
STOC-1994-PapadimitriouY #bound #complexity #on the: On complexity as bounded rationality (CHP, MY), pp. 726–733.
STOC-1993-PapadimitriouY #linear #matrix #programming: Linear programming without the matrix (CHP, MY), pp. 121–129.
PODS-1992-PapadimitriouY #semantics: Tie-Breaking Semantics and Structural Totality (CHP, MY), pp. 16–22.
STOC-1992-DahlhausJPSY #complexity #multi: The Complexity of Multiway Cuts (ED, DSJ, CHP, PDS, MY), pp. 241–251.
STOC-1990-PapadimitriouSY #complexity #on the: On the Complexity of Local Search (CHP, AAS, MY), pp. 438–445.
ICALP-1989-PapadimitriouY: Shortest Paths Without a Map (CHP, MY), pp. 610–620.
PODS-1988-KolaitisP #fixpoint #question #why: Why Not Negation by Fixpoint? (PGK, CHP), pp. 231–239.
STOC-1988-PapadimitriouY88a #approximate #complexity #optimisation: Optimization, Approximation, and Complexity Classes (CHP, MY), pp. 229–234.
STOC-1988-PapadimitriouY88b #algorithm #analysis #architecture #independence #parallel #towards: Towards an Architecture-Independent Analysis of Parallel Algorithms (CHP, MY), pp. 510–513.
PODS-1987-AfratiP #complexity #parallel #query: The Parallel Complexity of Simple Chain Queries (FNA, CHP), pp. 210–213.
PODS-1986-AfratiPPRSU #convergence #evaluation #query: Convergence of Sideways Query Evaluation (FNA, CHP, GP, AR, YS, JDU), pp. 24–30.
PODS-1985-HadzilacosP #algorithm #aspect-oriented #concurrent #multi: Algorithmic Aspects of Multiversion Concurrency Control (TH, CHP), pp. 96–104.
PODS-1985-PapadimitriouY #complexity #concurrent #reliability: The Complexity of Reliable Concurrency Control (CHP, MY), pp. 230–234.
ICALP-1984-AfratiPP #complexity #graph: The Complexity of Cubical Graphs (FNA, CHP, GP), pp. 51–57.
ICALP-1983-YannakakisKCP #clustering #graph: Cutting and Partitioning a Graph aifter a Fixed Pattern (MY, PCK, SSC, CHP), pp. 712–722.
PODS-1983-Cosmadakis83a #relational: Updates of Relational Views (SSC, CHP), pp. 317–331.
PODS-1982-CasanovaFP #dependence #functional #interactive: Inclusion Dependencies and Their Interaction with Functional Dependencies (MAC, RF, CHP), pp. 171–176.
PODS-1982-KanellakisP #distributed #question: Is Distributed Locking Harder? (PCK, CHP), pp. 98–107.
PODS-1982-PapadimitriouK #concurrent #multi #on the: On Concurrency Control by Multiple Versions (CHP, PCK), pp. 76–82.
STOC-1982-PapadimitriouS #communication #complexity: Communication Complexity (CHP, MS), pp. 196–200.
STOC-1982-PapadimitriouY #complexity: The Complexity of Facets (and Some Facets of Complexity) (CHP, MY), pp. 255–260.
SIGMOD-1981-Papadimitriou #on the #power of: On the Power of Locking (CHP), pp. 148–154.
ICALP-1980-LewisP #bound #symmetry: Symmetric Space-Bounded Computation (HRL, CHP), pp. 374–384.
ICALP-1980-PapadimitriouB #analysis #nearest neighbour #worst-case: A Worst-Case Analysis of Nearest Neighbor Searching by Projection (CHP, JLB), pp. 470–482.
ICALP-1979-PapadimitriouY #complexity #problem #strict: The Complexity of Restricted Minimum Spanning Tree Problems (CHP, MY), pp. 460–470.
SIGMOD-1979-KungP #concurrent #database: An Optimality Theory of Concurrency Control for Databases (HTK, CHP), pp. 116–126.
STOC-1976-PapadimitriouS #complexity #problem: Some Complexity Results for the Traveling Salesman Problem (CHP, KS), pp. 1–9.