 | 2010 |
|---|
| 122 |       | Balder ten Cate,
Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages.
Commun. CACM 53(1): 101-110 (2010) |
| 2009 |
|---|
| 121 | | Foto N. Afrati,
Phokion G. Kolaitis:
Repair checking in inconsistent databases: algorithms and complexity.
ICDT 2009: 31-41 |
| 120 | | Balder ten Cate,
Phokion G. Kolaitis:
Structural characterizations of schema-mapping languages.
ICDT 2009: 63-72 |
| 119 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa,
Wang Chiew Tan:
Reverse data exchange: coping with nulls.
PODS 2009: 23-32 |
| 118 | | Catriel Beeri,
Phokion G. Kolaitis,
Christos H. Papadimitriou:
The ACM PODS Alberto O. Mendelzon test-of-time-award 2009.
PODS 2009: 43 |
| 117 | | Phokion G. Kolaitis,
Swastik Kopparty:
Random graphs and the parity quantifier.
STOC 2009: 705-714 |
| 116 | | Balder ten Cate,
Laura Chiticariu,
Phokion G. Kolaitis,
Wang Chiew Tan:
Laconic schema mappings: computing core universal solutions by means of SQL queries
CoRR abs/0903.1953: (2009) |
| 115 | | Balder ten Cate,
Laura Chiticariu,
Phokion G. Kolaitis,
Wang Chiew Tan:
Laconic Schema Mappings: Computing the Core with SQL Queries.
PVLDB 2(1): 1006-1017 (2009) |
| 114 | | Parikshit Gopalan,
Phokion G. Kolaitis,
Elitza N. Maneva,
Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.
SIAM J. Comput. 38(6): 2330-2355 (2009) |
| 2008 |
|---|
| 113 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar].
Springer 2008 |
| 112 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
A Logical Approach to Constraint Satisfaction.
Complexity of Constraints 2008: 125-155 |
| 111 | | Foto N. Afrati,
Phokion G. Kolaitis:
Answering aggregate queries in data exchange.
PODS 2008: 129-138 |
| 110 | | Ronald Fagin,
Phokion G. Kolaitis,
Alan Nash,
Lucian Popa:
Towards a theory of schema-mapping optimization.
PODS 2008: 33-42 |
| 109 | | Laura Chiticariu,
Phokion G. Kolaitis,
Lucian Popa:
Interactive generation of integrated schemas.
SIGMOD Conference 2008: 833-846 |
| 108 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa,
Wang Chiew Tan:
Quasi-inverses of schema mappings.
ACM Trans. Database Syst. 33(2): (2008) |
| 107 | | Nadia Creignou,
Phokion G. Kolaitis,
Bruno Zanuttini:
Structure identification of Boolean relations and plain bases for co-clones.
J. Comput. Syst. Sci. 74(7): 1103-1115 (2008) |
| 106 | | Henry F. Korth,
Philip A. Bernstein,
Mary F. Fernández,
Le Gruenwald,
Phokion G. Kolaitis,
Kathryn S. McKinley,
M. Tamer Özsu:
Paper and proposal reviews: is the process flawed?
SIGMOD Record 37(3): 36-39 (2008) |
| 2007 |
|---|
| 105 | | Phokion G. Kolaitis:
Reflections on Finite Model Theory.
LICS 2007: 257-269 |
| 104 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa,
Wang Chiew Tan:
Quasi-inverses of schema mappings.
PODS 2007: 123-132 |
| 103 | | Laura Chiticariu,
Mauricio A. Hernández,
Phokion G. Kolaitis,
Lucian Popa:
Semi-Automatic Schema Integration in Clio.
VLDB 2007: 1326-1329 |
| 102 | | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Phase transitions of PP-complete satisfiability problems.
Discrete Applied Mathematics 155(12): 1627-1639 (2007) |
| 2006 |
|---|
| 101 |  | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
Complexity of Constraints, 01.10. - 06.10.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 100 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
06401 Abstracts Collection - Complexity of Constraints.
Complexity of Constraints 2006 |
| 99 | | Nadia Creignou,
Phokion G. Kolaitis,
Heribert Vollmer:
06401 Executive Summary - Complexity of Constraints.
Complexity of Constraints 2006 |
| 98 | | Parikshit Gopalan,
Phokion G. Kolaitis,
Elitza N. Maneva,
Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.
ICALP (1) 2006: 346-357 |
| 97 | | Phokion G. Kolaitis,
Jonathan Panttaja,
Wang Chiew Tan:
The complexity of data exchange.
PODS 2006: 30-39 |
| 96 | | T. S. Jayram,
Phokion G. Kolaitis,
Erik Vee:
The containment problem for REAL conjunctive queries with inequalities.
PODS 2006: 80-89 |
| 95 | | Ariel Fuxman,
Phokion G. Kolaitis,
Renée J. Miller,
Wang Chiew Tan:
Peer data exchange.
ACM Trans. Database Syst. 31(4): 1454-1498 (2006) |
| 94 | | Parikshit Gopalan,
Phokion G. Kolaitis,
Elitza N. Maneva,
Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
CoRR abs/cs/0609072: (2006) |
| 93 | | Parikshit Gopalan,
Phokion G. Kolaitis,
Elitza N. Maneva,
Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.
Electronic Colloquium on Computational Complexity (ECCC) 13(094): (2006) |
| 92 | | Tomás Feder,
Phokion G. Kolaitis:
Closures and dichotomies for quantified constraints.
Electronic Colloquium on Computational Complexity (ECCC) 13(160): (2006) |
| 91 | | Albert Atserias,
Anuj Dawar,
Phokion G. Kolaitis:
On preservation under homomorphisms and unions of conjunctive queries.
J. ACM 53(2): 208-237 (2006) |
| 2005 |
|---|
| 90 | | Ariel Fuxman,
Phokion G. Kolaitis,
Renée J. Miller,
Wang Chiew Tan:
Peer data exchange.
PODS 2005: 160-171 |
| 89 | | Phokion G. Kolaitis:
Schema mappings, data exchange, and metadata management.
PODS 2005: 61-75 |
| 88 | | Ronald Fagin,
Phokion G. Kolaitis,
Ravi Kumar,
Jasmine Novak,
D. Sivakumar,
Andrew Tomkins:
Efficient Implementation of Large-Scale Multi-Structural Databases.
VLDB 2005: 958-969 |
| 87 | | Phokion G. Kolaitis:
LICS 2003 special issue.
ACM Trans. Comput. Log. 6(4): 674 (2005) |
| 86 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa:
Data exchange: getting to the core.
ACM Trans. Database Syst. 30(1): 174-210 (2005) |
| 85 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa,
Wang Chiew Tan:
Composing schema mappings: Second-order dependencies to the rescue.
ACM Trans. Database Syst. 30(4): 994-1055 (2005) |
| 84 | | Nadia Creignou,
Phokion G. Kolaitis,
Bruno Zanuttini:
Preferred representations of Boolean relations
Electronic Colloquium on Computational Complexity (ECCC)(119): (2005) |
| 83 | | Leopoldo E. Bertossi,
Jan Chomicki,
Parke Godfrey,
Phokion G. Kolaitis,
Alex Thomo,
Calisto Zuzarte:
Exchange, integration, and consistency of data: report on the ARISE/NISR workshop.
SIGMOD Record 34(3): 87-90 (2005) |
| 82 | | Ronald Fagin,
Phokion G. Kolaitis,
Renée J. Miller,
Lucian Popa:
Data exchange: semantics and query answering.
Theor. Comput. Sci. 336(1): 89-124 (2005) |
| 81 | | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes.
Theor. Comput. Sci. 340(3): 496-513 (2005) |
| 2004 |
|---|
| 80 | | Albert Atserias,
Phokion G. Kolaitis,
Moshe Y. Vardi:
Constraint Propagation as a Proof System.
CP 2004: 77-91 |
| 79 | | Albert Atserias,
Anuj Dawar,
Phokion G. Kolaitis:
On Preservation under Homomorphisms and Unions of Conjunctive Queries.
PODS 2004: 319-329 |
| 78 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa,
Wang Chiew Tan:
Composing Schema Mappings: Second-Order Dependencies to the Rescue.
PODS 2004: 83-94 |
| 77 | | Phokion G. Kolaitis:
Constraint Satisfaction, Complexity, and Logic.
SETN 2004: 1-2 |
| 76 | | Phokion G. Kolaitis,
Michael J. Franklin:
Foreword.
ACM Trans. Database Syst. 29: 1 (2004) |
| 75 | | Phokion G. Kolaitis,
Victor Vianu:
Foreword.
J. ACM 51(1): 1 (2004) |
| 74 | | Georg Gottlob,
Phokion G. Kolaitis,
Thomas Schwentick:
Existential second-order logic over graphs: Charting the tractability frontier.
J. ACM 51(2): 312-362 (2004) |
| 73 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription.
Theory Comput. Syst. 37(6): 695-715 (2004) |
| 2003 |
|---|
| 72 | | Phokion G. Kolaitis,
Jonathan Panttaja:
On the Complexity of Existential Pebble Games.
CSL 2003: 314-329 |
| 71 | | Ronald Fagin,
Phokion G. Kolaitis,
Renée J. Miller,
Lucian Popa:
Data Exchange: Semantics and Query Answering.
ICDT 2003: 207-224 |
| 70 | | Delbert D. Bailey,
Phokion G. Kolaitis:
Phase Transitions of Bounded Satisfiability Problems.
IJCAI 2003: 1187-1193 |
| 69 | | Phokion G. Kolaitis:
Constraint Satisfaction, Databases, and Logic.
IJCAI 2003: 1587-1595 |
| 68 | | Ronald Fagin,
Phokion G. Kolaitis,
Lucian Popa:
Data exchange: getting to the core.
PODS 2003: 90-101 |
| 67 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
The complexity of minimal satisfiability problems.
Inf. Comput. 187(1): 20-39 (2003) |
| 2002 |
|---|
| 66 | | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems.
AAAI/IAAI 2002: 620-626 |
| 65 | | Víctor Dalmau,
Phokion G. Kolaitis,
Moshe Y. Vardi:
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics.
CP 2002: 310-326 |
| 2001 |
|---|
| 64 | | Phokion G. Kolaitis,
Thomas Raffill:
In Search of a Phase Transition in the AC-Matching Problem.
CP 2001: 433-450 |
| 63 | | Delbert D. Bailey,
Víctor Dalmau,
Phokion G. Kolaitis:
Phase Transitions of PP-Complete Satisfiability Problems.
IJCAI 2001: 183-192 |
| 62 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
A Dichotomy in the Complexity of Propositional Circumscription.
LICS 2001: 71-80 |
| 61 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
On the Complexity of Model Checking and Inference in Minimal Models.
LPNMR 2001: 42-53 |
| 60 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
The Complexity of Minimal Satisfiability Problems.
STACS 2001: 407-418 |
| 59 | | Joseph Y. Halpern,
Robert Harper,
Neil Immerman,
Phokion G. Kolaitis,
Moshe Y. Vardi,
Victor Vianu:
On the unusual effectiveness of logic in computer science.
Bulletin of Symbolic Logic 7(2): 213-236 (2001) |
| 2000 |
|---|
| 58 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
A Game-Theoretic Approach to Constraint Satisfaction.
AAAI/IAAI 2000: 175-181 |
| 57 | | Georg Gottlob,
Phokion G. Kolaitis,
Thomas Schwentick:
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.
FOCS 2000: 664-674 |
| 56 | | Arnaud Durand,
Miki Hermann,
Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes.
MFCS 2000: 323-332 |
| 55 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey.
MFCS 2000: 84-98 |
| 54 | | Lefteris M. Kirousis,
Phokion G. Kolaitis:
The Complexity of Minimal Satisfiability Problems
Electronic Colloquium on Computational Complexity (ECCC) 7(82): (2000) |
| 53 | | Miki Hermann,
Phokion G. Kolaitis:
Unification Algorithms Cannot Be Combined in Polynomial Time.
Inf. Comput. 162(1-2): 24-42 (2000) |
| 52 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction.
J. Comput. Syst. Sci. 61(2): 302-332 (2000) |
| 51 | | Foto N. Afrati,
Phokion G. Kolaitis:
Foreword: Selected Papers from ICDT 1997.
Theor. Comput. Sci. 239(2): 187 (2000) |
| 1999 |
|---|
| 50 | | Albert Atserias,
Phokion G. Kolaitis:
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory.
LICS 1999: 275-284 |
| 49 | | Miki Hermann,
Laurent Juban,
Phokion G. Kolaitis:
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System.
LPAR 1999: 13-32 |
| 48 | | Miki Hermann,
Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems.
J. Autom. Reasoning 23(2): 107-136 (1999) |
| 1998 |
|---|
| 47 | | Phokion G. Kolaitis,
Martin Otto:
On the Boundedness Problem for Two-Variable First-Order Logic.
LICS 1998: 513-524 |
| 46 | | Phokion G. Kolaitis,
David L. Martin,
Madhukar N. Thakur:
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates.
PODS 1998: 197-204 |
| 45 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction.
PODS 1998: 205-213 |
| 44 | | Kim B. Bruce,
Phokion G. Kolaitis,
Daniel Leivant,
Moshe Y. Vardi:
Panel: logic in the computer science curriculum.
SIGCSE 1998: 376-377 |
| 43 | | Ian Barland,
Phokion G. Kolaitis,
Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability.
J. Comput. Syst. Sci. 57(2): 144-161 (1998) |
| 1997 |
|---|
| 42 | | Foto N. Afrati,
Phokion G. Kolaitis:
Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings
Springer 1997 |
| 41 | | Miki Hermann,
Phokion G. Kolaitis:
On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups.
CP 1997: 282-296 |
| 40 | | Lauri Hella,
Phokion G. Kolaitis,
Kerkko Luosto:
How to Define a Linear Order on Finite Models.
Ann. Pure Appl. Logic 87(3): 241-267 (1997) |
| 39 | | Erich Grädel,
Phokion G. Kolaitis,
Moshe Y. Vardi:
On the decision problem for two-variable first-order logic.
Bulletin of Symbolic Logic 3(1): 53-69 (1997) |
| 38 | | Surajit Chaudhuri,
Phokion G. Kolaitis:
Can Datalog Be Approximated?
J. Comput. Syst. Sci. 55(2): 355-369 (1997) |
| 1996 |
|---|
| 37 | | Neil Immerman,
Phokion G. Kolaitis:
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University
American Mathematical Society 1996 |
| 36 | | Miki Hermann,
Phokion G. Kolaitis:
Unification Algorithms Cannot be Combined in Polynomial Time.
CADE 1996: 246-260 |
| 35 | | Ian Barland,
Phokion G. Kolaitis,
Madhukar N. Thakur:
Integer Programming as a Framework for Optimization and Approximability.
IEEE Conference on Computational Complexity 1996: 249-259 |
| 34 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Variable-Confined Logics.
LICS 1996: 348-359 |
| 33 | | Lauri Hella,
Phokion G. Kolaitis,
Kerkko Luosto:
Almost everywhere equivalence of logics in finite model theory.
Bulletin of Symbolic Logic 2(4): 422-443 (1996) |
| 1995 |
|---|
| 32 | | Anuj Dawar,
Lauri Hella,
Phokion G. Kolaitis:
Implicit Definability and Infinitary Logic in Finite Model Theory.
ICALP 1995: 624-635 |
| 31 | | Phokion G. Kolaitis:
Languages for Polynomial-Time Queries - An Ongoing Quest.
ICDT 1995: 38-39 |
| 30 | | Miki Hermann,
Phokion G. Kolaitis:
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract).
MFCS 1995: 359-370 |
| 29 | | Phokion G. Kolaitis:
Combinatorial Games In Database Theory.
PODS 1995: 231-232 |
| 28 | | Phokion G. Kolaitis,
Jouko A. Väänänen:
Generalized Quantifiers and Pebble Games on Finite Structures.
Ann. Pure Appl. Logic 74(1): 23-75 (1995) |
| 27 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes.
J. Comput. Syst. Sci. 50(3): 391-411 (1995) |
| 26 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study.
J. Comput. Syst. Sci. 51(1): 110-134 (1995) |
| 25 | | Miki Hermann,
Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching.
J. Symb. Comput. 20(3): 343-362 (1995) |
| 1994 |
|---|
| 24 | | Miki Hermann,
Phokion G. Kolaitis:
The Complexity of Counting Problems in Equational Matching.
CADE 1994: 560-574 |
| 23 | | Lauri Hella,
Phokion G. Kolaitis,
Kerkko Luosto:
How to Define a Linear Order on Finite Models
LICS 1994: 40-49 |
| 22 | | Surajit Chaudhuri,
Phokion G. Kolaitis:
Can Datalog be Approximated?
PODS 1994: 86-96 |
| 21 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Logical Definability of NP Optimization Problems
Inf. Comput. 115(2): 321-353 (1994) |
| 1993 |
|---|
| 20 | | Phokion G. Kolaitis:
A Tutorial on Finite Model Theory (Abstract)
LICS 1993: 122 |
| 19 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract).
Structure in Complexity Theory Conference 1993: 31-41 |
| 1992 |
|---|
| 18 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Infinitary Logic for Computer Science.
ICALP 1992: 450-473 |
| 17 | | Phokion G. Kolaitis,
Jouko A. Väänänen:
Generalized Quantifiers and Pebble Games on Finite Structures
LICS 1992: 348-359 |
| 16 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory
LICS 1992: 46-57 |
| 15 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
Infinitary Logics and 0-1 Laws
Inf. Comput. 98(2): 258-294 (1992) |
| 1991 |
|---|
| 14 | | Phokion G. Kolaitis,
Madhukar N. Thakur:
Approximation Properties of NP Minimization Classes.
Structure in Complexity Theory Conference 1991: 353-366 |
| 13 | | Phokion G. Kolaitis:
The Expressive Power of Stratified Programs
Inf. Comput. 90(1): 50-66 (1991) |
| 12 | | Phokion G. Kolaitis,
Christos H. Papadimitriou:
Why not Negation by Fixpoint?
J. Comput. Syst. Sci. 43(1): 125-144 (1991) |
| 1990 |
|---|
| 11 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws for Infinitary Logics (Preliminary Report)
LICS 1990: 156-167 |
| 10 | | Phokion G. Kolaitis:
Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report)
LICS 1990: 168-180 |
| 9 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
On the Expressive Power of Datalog: Tools and a Case Study.
PODS 1990: 61-71 |
| 8 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic
Inf. Comput. 87(1/2): 301-337 (1990) |
| 7 | | Phokion G. Kolaitis,
Christos H. Papadimitriou:
Some Computational Aspects of Circumscription
J. ACM 37(1): 1-14 (1990) |
| 1988 |
|---|
| 6 | | Phokion G. Kolaitis,
Christos H. Papadimitriou:
Some Computational Aspects of Circumscription.
AAAI 1988: 455-469 |
| 5 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
0-1 Laws and Decision Problems for Fragments of Second-Order Logic
LICS 1988: 2-11 |
| 4 | | Phokion G. Kolaitis,
Christos H. Papadimitriou:
Why Not Negation by Fixpoint?
PODS 1988: 231-239 |
| 1987 |
|---|
| 3 | | Phokion G. Kolaitis,
Moshe Y. Vardi:
The Decision Problem for the Probabilities of Higher-Order Properties
STOC 1987: 425-435 |
| 1985 |
|---|
| 2 | | Phokion G. Kolaitis:
On Asymptotic Probability of Inductive Queries and Their Decision Problem.
Logic of Programs 1985: 153-166 |
| 1979 |
|---|
| 1 | | Phokion G. Kolaitis:
Recursion in a Quantifier vs. Elementary Induction.
J. Symb. Log. 44(2): 235-259 (1979) |
