Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Phokion G. Kolaitis
2010 – today
- 2013
[j49]Phokion G. Kolaitis, Enela Pema, Wang-Chiew Tan: Efficient Querying of Inconsistent Databases with Binary Integer Programming. PVLDB 6(6): 397-408 (2013)- [c88]Balder ten Cate, Phokion G. Kolaitis, Walied Othman: Data exchange with arithmetic operations. EDBT 2013: 537-548
- [c87]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: Schema mappings and data examples. EDBT 2013: 777-780
- [c86]Samson Abramsky, Georg Gottlob, Phokion G. Kolaitis: Robust Constraint Satisfaction and Local Hidden Variables in Quantum Mechanics. IJCAI 2013
- [c85]Benny Kimelfeld, Phokion G. Kolaitis: The complexity of mining maximal frequent subgraphs. PODS 2013: 13-24
- [c84]Phokion G. Kolaitis, Francesca Spezzano: The Semantics of Aggregate Queries in Data Exchange Revisited. SUM 2013: 233-246
- 2012
- [j48]Phokion G. Kolaitis, Enela Pema: A dichotomy in the complexity of consistent query answering for queries with two atoms. Inf. Process. Lett. 112(3): 77-85 (2012)
- [c83]Balder ten Cate, Gaëlle Fontaine, Phokion G. Kolaitis: On the data complexity of consistent query answering. ICDT 2012: 22-33
- [c82]
- [c81]Richard Hull, Phokion G. Kolaitis, Dirk Van Gucht: The ACM PODS Alberto O. Mendelzon test-of-time award 2012. PODS 2012: 35-36
- [c80]Ronald Fagin, Phokion G. Kolaitis: Local transformations and conjunctive-query equivalence. PODS 2012: 179-190
- 2011
- [j47]Phokion G. Kolaitis: The quest for a logic for polynomial-time computation: technical perspective. Commun. ACM 54(6): 103 (2011)
- [j46]Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis: Probabilistic data exchange. J. ACM 58(4): 15 (2011)
- [j45]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples. PVLDB 4(12): 1414-1417 (2011)
- [j44]Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt: Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). SIGMOD Record 40(1): 40-42 (2011)
- [j43]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Reverse data exchange: Coping with nulls. ACM Trans. Database Syst. 36(2): 11 (2011)
- [j42]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: Characterizing schema mappings via data examples. ACM Trans. Database Syst. 36(4): 23 (2011)
- [c79]Enela Pema, Phokion G. Kolaitis, Wang Chiew Tan: On the tractability and intractability of consistent conjunctive query answering. EDBT/ICDT Ph.D. Workshop 2011: 38-44
- [c78]Phokion G. Kolaitis: Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). FSTTCS 2011: 25-25
- [c77]
- [c76]Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: Designing and refining schema mappings via data examples. SIGMOD Conference 2011: 133-144
- [p1]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Schema Mapping Evolution Through Composition and Inversion. Schema Matching and Mapping 2011: 191-222
- 2010
- [j41]Balder ten Cate, Phokion G. Kolaitis: Structural characterizations of schema-mapping languages. Commun. ACM 53(1): 101-110 (2010)
- [c75]Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan: Database Constraints and Homomorphism Dualities. CP 2010: 475-490
- [c74]
- [c73]Jianwen Su, Phokion G. Kolaitis: The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. PODS 2010: 39-40
- [c72]Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan: Characterizing schema mappings via data examples. PODS 2010: 261-272
2000 – 2009
- 2009
- [j40]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)
- [j39]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)
- [c71]Foto N. Afrati, Phokion G. Kolaitis: Repair checking in inconsistent databases: algorithms and complexity. ICDT 2009: 31-41
- [c70]Balder ten Cate, Phokion G. Kolaitis: Structural characterizations of schema-mapping languages. ICDT 2009: 63-72
- [c69]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Reverse data exchange: coping with nulls. PODS 2009: 23-32
- [c68]Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou: The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. PODS 2009: 43
- [c67]
- [i7]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)
- [i6]Phokion G. Kolaitis, Swastik Kopparty: Random Graphs and the Parity Quantifier. Electronic Colloquium on Computational Complexity (ECCC) 16: 33 (2009)
- 2008
- [j38]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)
- [j37]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)
- [j36]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Quasi-inverses of schema mappings. ACM Trans. Database Syst. 33(2) (2008)
- [c66]Phokion G. Kolaitis, Moshe Y. Vardi: A Logical Approach to Constraint Satisfaction. Complexity of Constraints 2008: 125-155
- [c65]Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa: Towards a theory of schema-mapping optimization. PODS 2008: 33-42
- [c64]Foto N. Afrati, Phokion G. Kolaitis: Answering aggregate queries in data exchange. PODS 2008: 129-138
- [c63]Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa: Interactive generation of integrated schemas. SIGMOD Conference 2008: 833-846
- [e5]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): Complexity of Constraints - An Overview of Current Research Themes [Result of a Dagstuhl Seminar]. Lecture Notes in Computer Science 5250, Springer 2008, ISBN 978-3-540-92799-0
- 2007
- [j35]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase transitions of PP-complete satisfiability problems. Discrete Applied Mathematics 155(12): 1627-1639 (2007)
- [c62]
- [c61]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Quasi-inverses of schema mappings. PODS 2007: 123-132
- [c60]Laura Chiticariu, Mauricio A. Hernández, Phokion G. Kolaitis, Lucian Popa: Semi-Automatic Schema Integration in Clio. VLDB 2007: 1326-1329
- 2006
- [j34]Albert Atserias, Anuj Dawar, Phokion G. Kolaitis: On preservation under homomorphisms and unions of conjunctive queries. J. ACM 53(2): 208-237 (2006)
- [j33]Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan: Peer data exchange. ACM Trans. Database Syst. 31(4): 1454-1498 (2006)
- [c59]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Executive Summary - Complexity of Constraints. Complexity of Constraints 2006
- [c58]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer: 06401 Abstracts Collection - Complexity of Constraints. Complexity of Constraints 2006
- [c57]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
- [c56]Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan: The complexity of data exchange. PODS 2006: 30-39
- [c55]T. S. Jayram, Phokion G. Kolaitis, Erik Vee: The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89
- [e4]Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer (Eds.): Complexity of Constraints, 01.10. - 06.10.2006. Dagstuhl Seminar Proceedings 06401, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- [i5]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)
- [i4]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)
- [i3]Tomás Feder, Phokion G. Kolaitis: Closures and dichotomies for quantified constraints. Electronic Colloquium on Computational Complexity (ECCC) 13(160) (2006)
- 2005
- [j32]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)
- [j31]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)
- [j30]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005)
- [j29]
- [j28]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1): 174-210 (2005)
- [j27]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)
- [c54]
- [c53]Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan: Peer data exchange. PODS 2005: 160-171
- [c52]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
- [i2]Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini: Preferred representations of Boolean relations. Electronic Colloquium on Computational Complexity (ECCC)(119) (2005)
- 2004
- [j26]
- [j25]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)
- [j24]Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. 37(6): 695-715 (2004)
- [j23]
- [c51]Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Propagation as a Proof System. CP 2004: 77-91
- [c50]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan: Composing Schema Mappings: Second-Order Dependencies to the Rescue. PODS 2004: 83-94
- [c49]Albert Atserias, Anuj Dawar, Phokion G. Kolaitis: On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS 2004: 319-329
- [c48]
- 2003
- [j22]Lefteris M. Kirousis, Phokion G. Kolaitis: The complexity of minimal satisfiability problems. Inf. Comput. 187(1): 20-39 (2003)
- [c47]Phokion G. Kolaitis, Jonathan Panttaja: On the Complexity of Existential Pebble Games. CSL 2003: 314-329
- [c46]Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa: Data Exchange: Semantics and Query Answering. ICDT 2003: 207-224
- [c45]Delbert D. Bailey, Phokion G. Kolaitis: Phase Transitions of Bounded Satisfiability Problems. IJCAI 2003: 1187-1193
- [c44]
- [c43]Ronald Fagin, Phokion G. Kolaitis, Lucian Popa: Data exchange: getting to the core. PODS 2003: 90-101
- 2002
- [c42]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
- [c41]Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi: Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. CP 2002: 310-326
- [e3]Lucian Popa, Serge Abiteboul, Phokion G. Kolaitis (Eds.): Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA. ACM 2002, ISBN 1-58113-507-6
- 2001
- [j21]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)
- [c40]Phokion G. Kolaitis, Thomas Raffill: In Search of a Phase Transition in the AC-Matching Problem. CP 2001: 433-450
- [c39]Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis: Phase Transitions of PP-Complete Satisfiability Problems. IJCAI 2001: 183-192
- [c38]Lefteris M. Kirousis, Phokion G. Kolaitis: A Dichotomy in the Complexity of Propositional Circumscription. LICS 2001: 71-80
- [c37]Lefteris M. Kirousis, Phokion G. Kolaitis: On the Complexity of Model Checking and Inference in Minimal Models. LPNMR 2001: 42-53
- [c36]Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. STACS 2001: 407-418
- 2000
- [j20]Miki Hermann, Phokion G. Kolaitis: Unification Algorithms Cannot Be Combined in Polynomial Time. Inf. Comput. 162(1-2): 24-42 (2000)
- [j19]Phokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. J. Comput. Syst. Sci. 61(2): 302-332 (2000)
- [j18]Foto N. Afrati, Phokion G. Kolaitis: Foreword: Selected Papers from ICDT 1997. Theor. Comput. Sci. 239(2): 187 (2000)
- [c35]Phokion G. Kolaitis, Moshe Y. Vardi: A Game-Theoretic Approach to Constraint Satisfaction. AAAI/IAAI 2000: 175-181
- [c34]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674
- [c33]Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. MFCS 2000: 84-98
- [c32]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis: Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332
- [i1]Lefteris M. Kirousis, Phokion G. Kolaitis: The Complexity of Minimal Satisfiability Problems. Electronic Colloquium on Computational Complexity (ECCC) 7(82) (2000)
1990 – 1999
- 1999
- [j17]Miki Hermann, Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems. J. Autom. Reasoning 23(2): 107-136 (1999)
- [c31]Albert Atserias, Phokion G. Kolaitis: First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. LICS 1999: 275-284
- [c30]Miki Hermann, Laurent Juban, Phokion G. Kolaitis: On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. LPAR 1999: 13-32
- 1998
- [j16]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)
- [c29]Phokion G. Kolaitis, Martin Otto: On the Boundedness Problem for Two-Variable First-Order Logic. LICS 1998: 513-524
- [c28]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
- [c27]Phokion G. Kolaitis, Moshe Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction. PODS 1998: 205-213
- [c26]Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi: Panel: logic in the computer science curriculum. SIGCSE 1998: 376-377
- 1997
- [j15]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)
- [j14]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)
- [j13]Surajit Chaudhuri, Phokion G. Kolaitis: Can Datalog Be Approximated? J. Comput. Syst. Sci. 55(2): 355-369 (1997)
- [c25]Miki Hermann, Phokion G. Kolaitis: On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. CP 1997: 282-296
- [e2]Foto N. Afrati, Phokion G. Kolaitis (Eds.): Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997, Proceedings. Lecture Notes in Computer Science 1186, Springer 1997, ISBN 3-540-62222-5
- 1996
- [j12]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)
- [c24]Miki Hermann, Phokion G. Kolaitis: Unification Algorithms Cannot be Combined in Polynomial Time. CADE 1996: 246-260
- [c23]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
- [c22]Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Variable-Confined Logics. LICS 1996: 348-359
- [e1]Neil Immerman, Phokion G. Kolaitis (Eds.): Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, American Mathematical Society 1996, ISBN 0-8218-0517-7
- 1995
- [j11]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)
- [j10]Phokion G. Kolaitis, Madhukar N. Thakur: Approximation Properties of NP Minimization Classes. J. Comput. Syst. Sci. 50(3): 391-411 (1995)
- [j9]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)
- [j8]Miki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. J. Symb. Comput. 20(3): 343-362 (1995)
- [c21]Anuj Dawar, Lauri Hella, Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635
- [c20]
- [c19]Miki Hermann, Phokion G. Kolaitis: Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). MFCS 1995: 359-370
- [c18]
- 1994
- [j7]Phokion G. Kolaitis, Madhukar N. Thakur: Logical Definability of NP Optimization Problems. Inf. Comput. 115(2): 321-353 (1994)
- [c17]Miki Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in Equational Matching. CADE 1994: 560-574
- [c16]Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models. LICS 1994: 40-49
- [c15]
- 1993
- [c14]Phokion G. Kolaitis, Madhukar N. Thakur: Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). Structure in Complexity Theory Conference 1993: 31-41
- [c13]
- 1992
- [j6]Phokion G. Kolaitis, Moshe Y. Vardi: Infinitary Logics and 0-1 Laws. Inf. Comput. 98(2): 258-294 (1992)
- [c12]
- [c11]Phokion G. Kolaitis, Moshe Y. Vardi: Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory. LICS 1992: 46-57
- [c10]Phokion G. Kolaitis, Jouko A. Väänänen: Generalized Quantifiers and Pebble Games on Finite Structures. LICS 1992: 348-359
- 1991
- [j5]
- [j4]Phokion G. Kolaitis, Christos H. Papadimitriou: Why not Negation by Fixpoint? J. Comput. Syst. Sci. 43(1): 125-144 (1991)
- [c9]Phokion G. Kolaitis, Madhukar N. Thakur: Approximation Properties of NP Minimization Classes. Structure in Complexity Theory Conference 1991: 353-366
- 1990
- [j3]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)
- [j2]Phokion G. Kolaitis, Christos H. Papadimitriou: Some Computational Aspects of Circumscription. J. ACM 37(1): 1-14 (1990)
- [c8]Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws for Infinitary Logics (Preliminary Report). LICS 1990: 156-167
- [c7]Phokion G. Kolaitis: Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report). LICS 1990: 168-180
- [c6]Phokion G. Kolaitis, Moshe Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study. PODS 1990: 61-71
1980 – 1989
- 1988
- [c5]Phokion G. Kolaitis, Christos H. Papadimitriou: Some Computational Aspects of Circumscription. AAAI 1988: 455-469
- [c4]Phokion G. Kolaitis, Moshe Y. Vardi: 0-1 Laws and Decision Problems for Fragments of Second-Order Logic. LICS 1988: 2-11
- [c3]
- 1987
- [c2]Phokion G. Kolaitis, Moshe Y. Vardi: The Decision Problem for the Probabilities of Higher-Order Properties. STOC 1987: 425-435
- 1985
- [c1]Phokion G. Kolaitis: On Asymptotic Probability of Inductive Queries and Their Decision Problem. Logic of Programs 1985: 153-166
1970 – 1979
- 1979
- [j1]Phokion G. Kolaitis: Recursion in a Quantifier vs. Elementary Induction. J. Symb. Log. 44(2): 235-259 (1979)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:23 CEST by the dblp team