| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Phokion G. Kolaitis Ariel Fuxman , Phokion G. Kolaitis, Renée J. Miller , Wang Chiew Tan : Peer data exchange. PODS 2005 : 160-171 Phokion G. Kolaitis: Schema mappings, data exchange, and metadata management. PODS 2005 : 61-75 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 Phokion G. Kolaitis: LICS 2003 special issue. ACM Trans. Comput. Log. 6 (4): 674 (2005) Ronald Fagin , Phokion G. Kolaitis, Lucian Popa : Data exchange: getting to the core. ACM Trans. Database Syst. 30 (1): 174-210 (2005) 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) Nadia Creignou , Phokion G. Kolaitis, Bruno Zanuttini : Preferred representations of Boolean relations Electronic Colloquium on Computational Complexity (ECCC) (119): (2005) 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) 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) Arnaud Durand , Miki Hermann , Phokion G. Kolaitis: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340 (3): 496-513 (2005) Albert Atserias , Phokion G. Kolaitis, Moshe Y. Vardi : Constraint Propagation as a Proof System. CP 2004 : 77-91 Albert Atserias , Anuj Dawar , Phokion G. Kolaitis: On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004 : 319-329 Ronald Fagin , Phokion G. Kolaitis, Lucian Popa , Wang Chiew Tan : Composing Schema Mappings: Second-Order Dependencies to the Rescue. PODS 2004 : 83-94 Phokion G. Kolaitis: Constraint Satisfaction, Complexity, and Logic. SETN 2004 : 1-2 Phokion G. Kolaitis, Michael J. Franklin : Foreword. ACM Trans. Database Syst. 29 : 1 (2004) Phokion G. Kolaitis, Victor Vianu : Foreword. J. ACM 51 (1): 1 (2004) Georg Gottlob , Phokion G. Kolaitis, Thomas Schwentick : Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51 (2): 312-362 (2004) Lefteris M. Kirousis , Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37 (6): 695-715 (2004) Phokion G. Kolaitis, Jonathan Panttaja : On the Complexity of Existential Pebble Games. CSL 2003 : 314-329 Ronald Fagin , Phokion G. Kolaitis, Renée J. Miller , Lucian Popa : Data Exchange: Semantics and Query Answering. ICDT 2003 : 207-224 Delbert D. Bailey , Phokion G. Kolaitis: Phase Transitions of Bounded Satisfiability Problems. IJCAI 2003 : 1187-1193 Phokion G. Kolaitis: Constraint Satisfaction, Databases, and Logic. IJCAI 2003 : 1587-1595 Ronald Fagin , Phokion G. Kolaitis, Lucian Popa : Data exchange: getting to the core. PODS 2003 : 90-101 Lefteris M. Kirousis , Phokion G. Kolaitis: The complexity of minimal satisfiability problems. Inf. Comput. 187 (1): 20-39 (2003) 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 Víctor Dalmau , Phokion G. Kolaitis, Moshe Y. Vardi : Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002 : 310-326 Phokion G. Kolaitis, Thomas Raffill : In Search of a Phase Transition in the AC-Matching Problem. CP 2001 : 433-450 Delbert D. Bailey , Víctor Dalmau , Phokion G. Kolaitis: Phase Transitions of PP-Complete Satisfiability Problems. IJCAI 2001 : 183-192 Lefteris M. Kirousis , Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001 : 71-80 Lefteris M. Kirousis , Phokion G. Kolaitis: On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001 : 42-53 Lefteris M. Kirousis , Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. STACS 2001 : 407-418 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) Phokion G. Kolaitis, Moshe Y. Vardi : A Game-Theoretic Approach to Constraint Satisfaction. AAAI/IAAI 2000 : 175-181 Georg Gottlob , Phokion G. Kolaitis, Thomas Schwentick : Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000 : 664-674 Arnaud Durand , Miki Hermann , Phokion G. Kolaitis: Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000 : 323-332 Phokion G. Kolaitis, Moshe Y. Vardi : 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. MFCS 2000 : 84-98 Lefteris M. Kirousis , Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems Electronic Colloquium on Computational Complexity (ECCC) 7 (82): (2000) Miki Hermann , Phokion G. Kolaitis: Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162 (1-2): 24-42 (2000) Phokion G. Kolaitis, Moshe Y. Vardi : Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61 (2): 302-332 (2000) Foto N. Afrati , Phokion G. Kolaitis: Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239 (2): 187 (2000) Albert Atserias , Phokion G. Kolaitis: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. LICS 1999 : 275-284 Miki Hermann , Laurent Juban , Phokion G. Kolaitis: On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999 : 13-32 Miki Hermann , Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reasoning 23 (2): 107-136 (1999) Phokion G. Kolaitis, Martin Otto : On the Boundedness Problem for Two-Variable First-Order Logic. LICS 1998 : 513-524 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 Phokion G. Kolaitis, Moshe Y. Vardi : Conjunctive-Query Containment and Constraint Satisfaction. PODS 1998 : 205-213 Kim B. Bruce , Phokion G. Kolaitis, Daniel Leivant , Moshe Y. Vardi : Panel: logic in the computer science curriculum. SIGCSE 1998 : 376-377 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) Foto N. Afrati , Phokion G. Kolaitis: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings Springer 1997 Miki Hermann , Phokion G. Kolaitis: On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997 : 282-296 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) 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) Surajit Chaudhuri , Phokion G. Kolaitis: Can Datalog Be Approximated? J. Comput. Syst. Sci. 55 (2): 355-369 (1997) 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 Miki Hermann , Phokion G. Kolaitis: Unification Algorithms Cannot be Combined in Polynomial Time. CADE 1996 : 246-260 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 Phokion G. Kolaitis, Moshe Y. Vardi : On the Expressive Power of Variable-Confined Logics. LICS 1996 : 348-359 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) Anuj Dawar , Lauri Hella , Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995 : 624-635 Phokion G. Kolaitis: Languages for Polynomial-Time Queries - An Ongoing Quest. ICDT 1995 : 38-39 Miki Hermann , Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS 1995 : 359-370 Phokion G. Kolaitis: Combinatorial Games In Database Theory. PODS 1995 : 231-232 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) Phokion G. Kolaitis, Madhukar N. Thakur : Approximation Properties of NP Minimization Classes. J. Comput. Syst. Sci. 50 (3): 391-411 (1995) 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) Miki Hermann , Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20 (3): 343-362 (1995) Miki Hermann , Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. CADE 1994 : 560-574 Lauri Hella , Phokion G. Kolaitis, Kerkko Luosto : How to Define a Linear Order on Finite Models LICS 1994 : 40-49 Surajit Chaudhuri , Phokion G. Kolaitis: Can Datalog be Approximated? PODS 1994 : 86-96 Phokion G. Kolaitis, Madhukar N. Thakur : Logical Definability of NP Optimization Problems Inf. Comput. 115 (2): 321-353 (1994) Phokion G. Kolaitis: A Tutorial on Finite Model Theory (Abstract) LICS 1993 : 122 Phokion G. Kolaitis, Madhukar N. Thakur : Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). Structure in Complexity Theory Conference 1993 : 31-41 Phokion G. Kolaitis, Moshe Y. Vardi : Infinitary Logic for Computer Science. ICALP 1992 : 450-473 Phokion G. Kolaitis, Jouko A. Väänänen : Generalized Quantifiers and Pebble Games on Finite Structures LICS 1992 : 348-359 Phokion G. Kolaitis, Moshe Y. Vardi : Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory LICS 1992 : 46-57 Phokion G. Kolaitis, Moshe Y. Vardi : Infinitary Logics and 0-1 Laws Inf. Comput. 98 (2): 258-294 (1992) Phokion G. Kolaitis, Madhukar N. Thakur : Approximation Properties of NP Minimization Classes. Structure in Complexity Theory Conference 1991 : 353-366 Phokion G. Kolaitis: The Expressive Power of Stratified Programs Inf. Comput. 90 (1): 50-66 (1991) Phokion G. Kolaitis, Christos H. Papadimitriou : Why not Negation by Fixpoint? J. Comput. Syst. Sci. 43 (1): 125-144 (1991) Phokion G. Kolaitis, Moshe Y. Vardi : 0-1 Laws for Infinitary Logics (Preliminary Report) LICS 1990 : 156-167 Phokion G. Kolaitis: Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report) LICS 1990 : 168-180 Phokion G. Kolaitis, Moshe Y. Vardi : On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990 : 61-71 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) Phokion G. Kolaitis, Christos H. Papadimitriou : Some Computational Aspects of Circumscription J. ACM 37 (1): 1-14 (1990) Phokion G. Kolaitis, Christos H. Papadimitriou : Some Computational Aspects of Circumscription. AAAI 1988 : 455-469 Phokion G. Kolaitis, Moshe Y. Vardi : 0-1 Laws and Decision Problems for Fragments of Second-Order Logic LICS 1988 : 2-11 Phokion G. Kolaitis, Christos H. Papadimitriou : Why Not Negation by Fixpoint? PODS 1988 : 231-239 Phokion G. Kolaitis, Moshe Y. Vardi : The Decision Problem for the Probabilities of Higher-Order Properties STOC 1987 : 425-435 Phokion G. Kolaitis: On Asymptotic Probability of Inductive Queries and Their Decision Problem. Logic of Programs 1985 : 153-166 Phokion G. Kolaitis: Recursion in a Quantifier vs. Elementary Induction. J. Symb. Log. 44 (2): 235-259 (1979) 1 [ 42 ] [ 51 ] 2 [ 50 ] [ 79 ] [ 80 ] 3 [ 63 ] [ 66 ] [ 70 ] 4 [ 35 ] [ 43 ] 5 [ 83 ] 6 [ 44 ] 7 [ 22 ] [ 38 ] 8 [ 83 ] 9 [ 84 ] 10 [ 63 ] [ 65 ] [ 66 ] 11 [ 32 ] [ 79 ] 12 [ 56 ] [ 81 ] 13 [ 68 ] [ 71 ] [ 78 ] [ 82 ] [ 85 ] [ 86 ] [ 88 ] 14 [ 76 ] 15 [ 90 ] 16 [ 83 ] 17 [ 57 ] [ 74 ] 18 [ 39 ] 19 [ 59 ] 20 [ 59 ] 21 [ 23 ] [ 32 ] [ 33 ] [ 40 ] 22 [ 24 ] [ 25 ] [ 30 ] [ 36 ] [ 41 ] [ 48 ] [ 49 ] [ 53 ] [ 56 ] [ 81 ] 23 [ 37 ] [ 59 ] 24 [ 49 ] 25 [ 54 ] [ 60 ] [ 61 ] [ 62 ] [ 67 ] [ 73 ] 26 [ 88 ] 27 [ 44 ] 28 [ 23 ] [ 33 ] [ 40 ] 29 [ 46 ] 30 [ 71 ] [ 82 ] [ 90 ] 31 [ 88 ] 32 [ 47 ] 33 [ 72 ] 34 [ 4 ] [ 6 ] [ 7 ] [ 12 ] 35 [ 68 ] [ 71 ] [ 78 ] [ 82 ] [ 85 ] [ 86 ] 36 [ 64 ] 37 [ 57 ] [ 74 ] 38 [ 88 ] 39 [ 78 ] [ 85 ] [ 90 ] 40 [ 14 ] [ 19 ] [ 21 ] [ 27 ] [ 35 ] [ 43 ] [ 46 ] 41 [ 83 ] 42 [ 88 ] 43 [ 17 ] [ 28 ] 44 [ 3 ] [ 5 ] [ 8 ] [ 9 ] [ 11 ] [ 15 ] [ 16 ] [ 18 ] [ 26 ] [ 34 ] [ 39 ] [ 44 ] [ 45 ] [ 52 ] [ 55 ] [ 58 ] [ 59 ] [ 65 ] [ 80 ] 45 [ 59 ] [ 75 ] 46 [ 84 ] 47 [ 83 ]  ©2006 Association for Computing Machinery |
