BibSLEIGH — Phokion_G

Travelled to:

1 × Australia
1 × China
1 × Greece
1 × Hungary
1 × Norway
1 × Poland
1 × United Kingdom
2 × Canada
2 × Italy
21 × USA
3 × Austria
3 × France

Collaborated with:

M.Y.Vardi ∅ W.C.Tan R.Fagin L.Popa L.Hella M.Hermann B.Kimelfeld B.Alexe L.Chiticariu J.Panttaja A.Atserias B.t.Cate C.H.Papadimitriou A.Dawar S.Kopparty F.N.Afrati L.M.Kirousis M.Otto S.Chaudhuri J.A.Väänänen E.Pema W.Tan T.S.Jayram E.Vee D.L.Martin M.N.Thakur K.Luosto R.Pichler E.Sallinger V.Savenkov A.Nash M.A.Hernández P.Gopalan E.N.Maneva A.Fuxman R.J.Miller R.Kumar J.Novak D.Sivakumar A.Tomkins

Talks about:

schema (11) logic (11) data (9) map (9) queri (8) complex (7) finit (7) structur (6) problem (6) exchang (6)

Person: Phokion G. Kolaitis

DBLP: Kolaitis:Phokion_G=

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2001

1999

1998

1996

1995

1994

1992

1990

1988

1987

2016

2017

Wrote 50 papers:

PODS-2015-FaginKK #complexity: Dichotomies in the Complexity of Preferred Repairs (RF, BK, PGK), pp. 3–15.
PODS-2014-KolaitisPSS #dependence #reasoning: Nested dependencies: structure and reasoning (PGK, RP, ES, VS), pp. 176–187.
PODS-2013-KimelfeldK #complexity #mining: The complexity of mining maximal frequent subgraphs (BK, PGK), pp. 13–24.
VLDB-2013-KolaitisPT #consistency #database #integer #performance #programming #query: Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.
PODS-2012-FaginK #equivalence: Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.
SIGMOD-2011-AlexeCKT #design: Designing and refining schema mappings via data examples (BA, BtC, PGK, WCT), pp. 133–144.
VLDB-2011-AlexeCKT #design #interactive #named #refinement: EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples (BA, BtC, PGK, WCT), pp. 1414–1417.
PODS-2010-AlexeKT: Characterizing schema mappings via data examples (BA, PGK, WCT), pp. 261–272.
PODS-2009-FaginKPT: Reverse data exchange: coping with nulls (RF, PGK, LP, WCT), pp. 23–32.
STOC-2009-KolaitisK #graph #quantifier #random: Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
VLDB-2009-CateCKT #query #sql: Laconic Schema Mappings: Computing the Core with SQL Queries (BtC, LC, PGK, WCT), pp. 1006–1017.
PODS-2008-AfratiK #query: Answering aggregate queries in data exchange (FNA, PGK), pp. 129–138.
PODS-2008-FaginKNP #formal method #optimisation #towards: Towards a theory of schema-mapping optimization (RF, PGK, AN, LP), pp. 33–42.
SIGMOD-2008-ChiticariuKP #generative #interactive: Interactive generation of integrated schemas (LC, PGK, LP), pp. 833–846.
LICS-2007-Kolaitis #finite: Reflections on Finite Model Theory (PGK), pp. 257–269.
PODS-2007-FaginKPT: Quasi-inverses of schema mappings (RF, PGK, LP, WCT), pp. 123–132.
VLDB-2007-ChiticariuHPK #automation #integration: Semi-Automatic Schema Integration in Clio (LC, MAH, PGK, LP), pp. 1326–1329.
ICALP-v1-2006-GopalanKMP #satisfiability: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (PG, PGK, ENM, CHP), pp. 346–357.
PODS-2006-JayramKV #problem #query: The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.
PODS-2006-KolaitisPT #complexity: The complexity of data exchange (PGK, JP, WCT), pp. 30–39.
PODS-2005-FuxmanKMT: Peer data exchange (AF, PGK, RJM, WCT), pp. 160–171.
PODS-2005-Kolaitis #data transformation #metadata: Schema mappings, data exchange, and metadata management (PGK), pp. 61–75.
VLDB-2005-FaginKKNST #database #implementation #multi #performance #scalability: Efficient Implementation of Large-Scale Multi-Structural Databases (RF, PGK, RK, JN, DS, AT), pp. 958–969.
PODS-2004-AtseriasDK #morphism #on the #query: On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
PODS-2004-FaginPKT #dependence #higher-order: Composing Schema Mappings: Second-Order Dependencies to the Rescue (RF, PGK, LP, WCT), pp. 83–94.
CSL-2003-KolaitisP #complexity #game studies #on the: On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.
PODS-2003-FaginKP: Data exchange: getting to the core (RF, PGK, LP), pp. 90–101.
LICS-2001-KirousisK #complexity: A Dichotomy in the Complexity of Propositional Circumscription (LMK, PGK), pp. 71–80.
LICS-1999-AtseriasK #finite #first-order #fixpoint #logic #set: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory (AA, PGK), pp. 275–284.
LICS-1998-KolaitisO #bound #first-order #logic #on the #problem: On the Boundedness Problem for Two-Variable First-Order Logic (PGK, MO), pp. 513–524.
PODS-1998-KolaitisMT #complexity #on the #problem #query: On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
PODS-1998-KolaitisV #constraints: Conjunctive-Query Containment and Constraint Satisfaction (PGK, MYV), pp. 205–213.
CADE-1996-HermannK #algorithm #polynomial #unification: Unification Algorithms Cannot be Combined in Polynomial Time (MH, PGK), pp. 246–260.
LICS-1996-KolaitisV #logic #on the #power of: On the Expressive Power of Variable-Confined Logics (PGK, MYV), pp. 348–359.
ICALP-1995-DawarHK #finite #logic: Implicit Definability and Infinitary Logic in Finite Model Theory (AD, LH, PGK), pp. 624–635.
PODS-1995-Kolaitis #combinator #database #game studies: Combinatorial Games In Database Theory (PGK), pp. 231–232.
CADE-1994-HermannK #complexity #equation #problem: The Complexity of Counting Problems in Equational Matching (MH, PGK), pp. 560–574.
LICS-1994-HellaKL #finite #how #linear #modelling #order: How to Define a Linear Order on Finite Models (LH, PGK, KL), pp. 40–49.
PODS-1994-ChaudhuriK #approximate #datalog #question: Can Datalog be Approximated? (SC, PGK), pp. 86–96.
ICALP-1992-KolaitisV #logic: Infinitary Logic for Computer Science (PGK, MYV), pp. 450–473.
LICS-1992-KolaitisV #fixpoint #logic: Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory (PGK, MYV), pp. 46–57.
LICS-1992-VaananenK #finite #game studies #quantifier: Generalized Quantifiers and Pebble Games on Finite Structures (PGK, JAV), pp. 348–359.
LICS-1990-Kolaitis #ambiguity #finite: Implicit Definability on Finite Structures and Unambiguous Computations (PGK), pp. 168–180.
LICS-1990-KolaitisV #logic: 0-1 Laws for Infinitary Logics (PGK, MYV), pp. 156–167.
PODS-1990-KolaitisV #case study #datalog #on the #power of #tool support: On the Expressive Power of Datalog: Tools and a Case Study (PGK, MYV), pp. 61–71.
LICS-1988-KolaitisV #higher-order #logic #problem: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic (PGK, MYV), pp. 2–11.
PODS-1988-KolaitisP #fixpoint #question #why: Why Not Negation by Fixpoint? (PGK, CHP), pp. 231–239.
STOC-1987-KolaitisV #higher-order #problem: The Decision Problem for the Probabilities of Higher-Order Properties (PGK, MYV), pp. 425–435.
CSL-2016-HellaK #constraints #dependence #logic: Dependence Logic vs. Constraint Satisfaction (LH, PGK), p. 17.
CSL-2017-Kolaitis: Schema Mappings: Structural Properties and Limits (Invited Talk) (PGK), p. 1.