DBLife: Phokion G. Kolaitis

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

2012

130

A dichotomy in the complexity of consistent query answering for queries with two atoms. Phokion G. Kolaitis, Enela Pema. Inf. Process. Lett. (112): 77-85 (2012). Web SearchBibTeXDownload

2011

129

Reverse data exchange: Coping with nulls. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. ACM Trans. Database Syst. (36): 11 (2011). Web SearchBibTeXDownload

128

The quest for a logic for polynomial-time computation: technical perspective. Phokion G. Kolaitis. Commun. ACM (54): 103 (2011). Web SearchBibTeXDownload

127

On the tractability and intractability of consistent conjunctive query answering. Enela Pema, Phokion G. Kolaitis, Wang Chiew Tan. EDBT/ICDT Ph.D. Workshop 2011, 38-44. Web SearchBibTeXDownload

126

Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). Phokion G. Kolaitis. FSTTCS 2011, 25-25. Web SearchBibTeXDownload

125

Probabilistic data exchange. Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis. J. ACM (58): 15 (2011). Web SearchBibTeXDownload

124

Schema mappings and data examples. Phokion G. Kolaitis. LID 2011, 1. Web SearchBibTeXDownload

123

EIRENE: Interactive Design and Refinement of Schema Mappings via Data Examples. Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan. PVLDB (4): 1414-1417 (2011). Web SearchBibTeXDownload

122

Schema Mapping Evolution Through Composition and Inversion. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. Schema Matching and Mapping 2011, 191-222. Web SearchBibTeXDownload

121

Designing and refining schema mappings via data examples. Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan. SIGMOD Conference 2011, 133-144. Web SearchBibTeXDownload

120

Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt. SIGMOD Record (40): 40-42 (2011). Web SearchBibTeXDownload

2010

119

Structural characterizations of schema-mapping languages. Balder ten Cate, Phokion G. Kolaitis. Commun. ACM (53): 101-110 (2010). Web SearchBibTeXDownload

118

Database Constraints and Homomorphism Dualities. Balder ten Cate, Phokion G. Kolaitis, Wang Chiew Tan. CP 2010, 475-490. Web SearchBibTeXDownload

117

Probabilistic data exchange. Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis. ICDT 2010, 76-88. Web SearchBibTeXDownload

116

The ACM PODS Alberto O. Mendelzon test-of-time-award 2010. Jianwen Su, Phokion G. Kolaitis. PODS 2010, 39-40. Web SearchBibTeXDownload

115

Characterizing schema mappings via data examples. Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan. PODS 2010, 261-272. Web SearchBibTeXDownload

2009

114

Laconic schema mappings: computing core universal solutions by means of SQL queries. Balder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan. CoRR (abs/0903.1953) (2009). Web SearchBibTeXDownload

113

Random Graphs and the Parity Quantifier. Phokion G. Kolaitis, Swastik Kopparty. Electronic Colloquium on Computational Complexity (ECCC) (16): 33 (2009). Web SearchBibTeXDownload

112

Structural characterizations of schema-mapping languages. Balder ten Cate, Phokion G. Kolaitis. ICDT 2009, 63-72. Web SearchBibTeXDownload

111

Repair checking in inconsistent databases: algorithms and complexity. Foto N. Afrati, Phokion G. Kolaitis. ICDT 2009, 31-41. Cited by 6Web SearchBibTeXDownload

110

The ACM PODS Alberto O. Mendelzon test-of-time-award 2009. Catriel Beeri, Phokion G. Kolaitis, Christos H. Papadimitriou. PODS 2009, 43. Web SearchBibTeXDownload

109

Reverse data exchange: coping with nulls. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. PODS 2009, 23-32. Cited by 2Web SearchBibTeXDownload

108

Laconic Schema Mappings: Computing the Core with SQL Queries. Balder ten Cate, Laura Chiticariu, Phokion G. Kolaitis, Wang Chiew Tan. PVLDB (2): 1006-1017 (2009). Web SearchBibTeXDownload

107

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou. SIAM J. Comput. (38): 2330-2355 (2009). Web SearchBibTeXDownload

106

Random graphs and the parity quantifier. Phokion G. Kolaitis, Swastik Kopparty. STOC 2009, 705-714. Web SearchBibTeXDownload

2008

105

Quasi-inverses of schema mappings. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. ACM Trans. Database Syst. (33) (2008). Cited by 29Web SearchBibTeXDownload

104

A Logical Approach to Constraint Satisfaction. Phokion G. Kolaitis, Moshe Y. Vardi. Complexity of Constraints 2008, 125-155. Cited by 9Web SearchBibTeXDownload

103

Structure identification of Boolean relations and plain bases for co-clones. Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini. J. Comput. Syst. Sci. (74): 1103-1115 (2008). Web SearchBibTeXDownload

102

Answering aggregate queries in data exchange. Foto N. Afrati, Phokion G. Kolaitis. PODS 2008, 129-138. Cited by 10Web SearchBibTeXDownload

101

Towards a theory of schema-mapping optimization. Ronald Fagin, Phokion G. Kolaitis, Alan Nash, Lucian Popa. PODS 2008, 33-42. Cited by 10Web SearchBibTeXDownload

100

Interactive generation of integrated schemas. Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa. SIGMOD Conference 2008, 833-846. Cited by 11Web SearchBibTeXDownload

Paper and proposal reviews: is the process flawed?. Henry F. Korth, Philip A. Bernstein, Mary F. Fernández, Le Gruenwald, Phokion G. Kolaitis, Kathryn S. McKinley, M. Tamer Özsu. SIGMOD Record (37): 36-39 (2008). Web SearchBibTeXDownload

2007

Phase transitions of PP-complete satisfiability problems. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis. Discrete Applied Mathematics (155): 1627-1639 (2007). Web SearchBibTeXDownload

Reflections on Finite Model Theory. Phokion G. Kolaitis. LICS 2007, 257-269. Web SearchBibTeXDownload

Quasi-inverses of schema mappings. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. PODS 2007, 123-132. Cited by 29Web SearchBibTeXDownload

Semi-Automatic Schema Integration in Clio. Laura Chiticariu, Mauricio A. Hernández, Phokion G. Kolaitis, Lucian Popa. VLDB 2007, 1326-1329. Cited by 14Web SearchBibTeXDownload

2006

Peer data exchange. Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan. ACM Trans. Database Syst. (31): 1454-1498 (2006). Cited by 50Web SearchBibTeXDownload

06401 Executive Summary - Complexity of Constraints. Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer. Complexity of Constraints 2006. Web SearchBibTeXDownload

06401 Abstracts Collection - Complexity of Constraints. Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer. Complexity of Constraints 2006. Web SearchBibTeXDownload

Closures and dichotomies for quantified constraints. Tomás Feder, Phokion G. Kolaitis. Electronic Colloquium on Computational Complexity (ECCC) (13) (2006). Web SearchBibTeXDownload

On preservation under homomorphisms and unions of conjunctive queries. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis. J. ACM (53): 208-237 (2006). Web SearchBibTeXDownload

The containment problem for REAL conjunctive queries with inequalities. T. S. Jayram, Phokion G. Kolaitis, Erik Vee. PODS 2006, 80-89. Web SearchBibTeXDownload

The complexity of data exchange. Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan. PODS 2006, 30-39. Web SearchBibTeXDownload

2005

LICS 2003 special issue. Phokion G. Kolaitis. ACM Trans. Comput. Log. (6): 674 (2005). Web SearchBibTeXDownload

Composing schema mappings: Second-order dependencies to the rescue. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. ACM Trans. Database Syst. (30): 994-1055 (2005). Cited by 136Web SearchBibTeXDownload

Data exchange: getting to the core. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa. ACM Trans. Database Syst. (30): 174-210 (2005). Cited by 144Web SearchBibTeXDownload

Preferred representations of Boolean relations. Nadia Creignou, Phokion G. Kolaitis, Bruno Zanuttini. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload

Schema mappings, data exchange, and metadata management. Phokion G. Kolaitis. PODS 2005, 61-75. Web SearchBibTeXDownload

Peer data exchange. Ariel Fuxman, Phokion G. Kolaitis, Renée J. Miller, Wang Chiew Tan. PODS 2005, 160-171. Cited by 50Web SearchBibTeXDownload

Exchange, integration, and consistency of data: report on the ARISE/NISR workshop. Leopoldo E. Bertossi, Jan Chomicki, Parke Godfrey, Phokion G. Kolaitis, Alex Thomo, Calisto Zuzarte. SIGMOD Record (34): 87-90 (2005). Cited by 6Web SearchBibTeXDownload

Subtractive reductions and complete problems for counting complexity classes. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis. Theor. Comput. Sci. (340): 496-513 (2005). Web SearchBibTeXDownload

Data exchange: semantics and query answering. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa. Theor. Comput. Sci. (336): 89-124 (2005). Cited by 353Web SearchBibTeXDownload

Efficient Implementation of Large-Scale Multi-Structural Databases. Ronald Fagin, Phokion G. Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, Andrew Tomkins. VLDB 2005, 958-969. Cited by 10Web SearchBibTeXDownload

2004

Constraint Propagation as a Proof System. Albert Atserias, Phokion G. Kolaitis, Moshe Y. Vardi. CP 2004, 77-91. Cited by 22Web SearchBibTeXDownload

Existential second-order logic over graphs: Charting the tractability frontier. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. J. ACM (51): 312-362 (2004). Web SearchBibTeXDownload

Composing Schema Mappings: Second-Order Dependencies to the Rescue. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wang Chiew Tan. PODS 2004, 83-94. Web SearchBibTeXDownload

On Preservation under Homomorphisms and Unions of Conjunctive Queries. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis. PODS 2004, 319-329. Web SearchBibTeXDownload

Constraint Satisfaction, Complexity, and Logic. Phokion G. Kolaitis. SETN 2004, 1-2. Web SearchBibTeXDownload

A Dichotomy in the Complexity of Propositional Circumscription. Lefteris M. Kirousis, Phokion G. Kolaitis. Theory Comput. Syst. (37): 695-715 (2004). Web SearchBibTeXDownload

2003

On the Complexity of Existential Pebble Games. Phokion G. Kolaitis, Jonathan Panttaja. CSL 2003, 314-329. Web SearchBibTeXDownload

Data Exchange: Semantics and Query Answering. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, Lucian Popa. ICDT 2003, 207-224. Web SearchBibTeXDownload

Phase Transitions of Bounded Satisfiability Problems. Delbert D. Bailey, Phokion G. Kolaitis. IJCAI 2003, 1187-1193. Web SearchBibTeX

Constraint Satisfaction, Databases, and Logic. Phokion G. Kolaitis. IJCAI 2003, 1587-1595. Web SearchBibTeX

The complexity of minimal satisfiability problems. Lefteris M. Kirousis, Phokion G. Kolaitis. Inf. Comput. (187): 20-39 (2003). Web SearchBibTeXDownload

Data exchange: getting to the core. Ronald Fagin, Phokion G. Kolaitis, Lucian Popa. PODS 2003, 90-101. Cited by 144Web SearchBibTeXDownload

2002

Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis. AAAI/IAAI 2002, 620-626. Web SearchBibTeX

Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi. CP 2002, 310-326. Cited by 72Web SearchBibTeXDownload

2001

On the unusual effectiveness of logic in computer science. Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi, Victor Vianu. Bulletin of Symbolic Logic (7): 213-236 (2001). Cited by 68Web SearchBibTeXDownload

In Search of a Phase Transition in the AC-Matching Problem. Phokion G. Kolaitis, Thomas Raffill. CP 2001, 433-450. Web SearchBibTeXDownload

Phase Transitions of PP-Complete Satisfiability Problems. Delbert D. Bailey, Víctor Dalmau, Phokion G. Kolaitis. IJCAI 2001, 183-192. Web SearchBibTeX

A Dichotomy in the Complexity of Propositional Circumscription. Lefteris M. Kirousis, Phokion G. Kolaitis. LICS 2001, 71-80. Web SearchBibTeXDownload

On the Complexity of Model Checking and Inference in Minimal Models. Lefteris M. Kirousis, Phokion G. Kolaitis. LPNMR 2001, 42-53. Web SearchBibTeXDownload

The Complexity of Minimal Satisfiability Problems. Lefteris M. Kirousis, Phokion G. Kolaitis. STACS 2001, 407-418. Web SearchBibTeXDownload

2000

A Game-Theoretic Approach to Constraint Satisfaction. Phokion G. Kolaitis, Moshe Y. Vardi. AAAI/IAAI 2000, 175-181. Cited by 46Web SearchBibTeX

The Complexity of Minimal Satisfiability Problems. Lefteris M. Kirousis, Phokion G. Kolaitis. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload

Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick. FOCS 2000, 664-674. Web SearchBibTeXDownload

Unification Algorithms Cannot Be Combined in Polynomial Time. Miki Hermann, Phokion G. Kolaitis. Inf. Comput. (162): 24-42 (2000). Web SearchBibTeXDownload

Conjunctive-Query Containment and Constraint Satisfaction. Phokion G. Kolaitis, Moshe Y. Vardi. J. Comput. Syst. Sci. (61): 302-332 (2000). Cited by 225Web SearchBibTeXDownload

Subtractive Reductions and Complete Problems for Counting Complexity Classes. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis. MFCS 2000, 323-332. Web SearchBibTeXDownload

0-1 Laws for Fragments of Existential Second-Order Logic: A Survey. Phokion G. Kolaitis, Moshe Y. Vardi. MFCS 2000, 84-98. Cited by 13Web SearchBibTeXDownload

Foreword: Selected Papers from ICDT 1997. Foto N. Afrati, Phokion G. Kolaitis. Theor. Comput. Sci. (239): 187 (2000). Web SearchBibTeXDownload

1999

Computational Complexity of Simultaneous Elementary Matching Problems. Miki Hermann, Phokion G. Kolaitis. J. Autom. Reasoning (23): 107-136 (1999). Web SearchBibTeXDownload

First-Order Logic vs. Fixed-Point Logic in Finite Set Theory. Albert Atserias, Phokion G. Kolaitis. LICS 1999, 275-284. Web SearchBibTeXDownload

On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System. Miki Hermann, Laurent Juban, Phokion G. Kolaitis. LPAR 1999, 13-32. Web SearchBibTeXDownload

1998

Integer Programming as a Framework for Optimization and Approximability. Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur. J. Comput. Syst. Sci. (57): 144-161 (1998). Web SearchBibTeXDownload

On the Boundedness Problem for Two-Variable First-Order Logic. Phokion G. Kolaitis, Martin Otto. LICS 1998, 513-524. Web SearchBibTeXDownload

On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates. Phokion G. Kolaitis, David L. Martin, Madhukar N. Thakur. PODS 1998, 197-204. Web SearchBibTeX

Conjunctive-Query Containment and Constraint Satisfaction. Phokion G. Kolaitis, Moshe Y. Vardi. PODS 1998, 205-213. Cited by 225Web SearchBibTeX

Panel: logic in the computer science curriculum. Kim B. Bruce, Phokion G. Kolaitis, Daniel Leivant, Moshe Y. Vardi. SIGCSE 1998, 376-377. Cited by 3Web SearchBibTeXDownload

1997

How to Define a Linear Order on Finite Models. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto. Ann. Pure Appl. Logic (87): 241-267 (1997). Web SearchBibTeXDownload

On the decision problem for two-variable first-order logic. Erich Grädel, Phokion G. Kolaitis, Moshe Y. Vardi. Bulletin of Symbolic Logic (3): 53-69 (1997). Cited by 136Web SearchBibTeXDownload

On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups. Miki Hermann, Phokion G. Kolaitis. CP 1997, 282-296. Web SearchBibTeXDownload

Can Datalog Be Approximated?. Surajit Chaudhuri, Phokion G. Kolaitis. J. Comput. Syst. Sci. (55): 355-369 (1997). Cited by 21Web SearchBibTeXDownload

1996

Almost everywhere equivalence of logics in finite model theory. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto. Bulletin of Symbolic Logic (2): 422-443 (1996). Web SearchBibTeXDownload

Unification Algorithms Cannot be Combined in Polynomial Time. Miki Hermann, Phokion G. Kolaitis. CADE 1996, 246-260. Web SearchBibTeXDownload

Integer Programming as a Framework for Optimization and Approximability. Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur. IEEE Conference on Computational Complexity 1996, 249-259. Web SearchBibTeXDownload

On the Expressive Power of Variable-Confined Logics. Phokion G. Kolaitis, Moshe Y. Vardi. LICS 1996, 348-359. Cited by 17Web SearchBibTeXDownload

1995

Generalized Quantifiers and Pebble Games on Finite Structures. Phokion G. Kolaitis, Jouko A. Väänänen. Ann. Pure Appl. Logic (74): 23-75 (1995). Web SearchBibTeXDownload

Implicit Definability and Infinitary Logic in Finite Model Theory. Anuj Dawar, Lauri Hella, Phokion G. Kolaitis. ICALP 1995, 624-635. Web SearchBibTeXDownload

Languages for Polynomial-Time Queries - An Ongoing Quest. Phokion G. Kolaitis. ICDT 1995, 38-39. Web SearchBibTeXDownload

Approximation Properties of NP Minimization Classes. Phokion G. Kolaitis, Madhukar N. Thakur. J. Comput. Syst. Sci. (50): 391-411 (1995). Web SearchBibTeXDownload

On the Expressive Power of Datalog: Tools and a Case Study. Phokion G. Kolaitis, Moshe Y. Vardi. J. Comput. Syst. Sci. (51): 110-134 (1995). Cited by 121Web SearchBibTeXDownload

The Complexity of Counting Problems in Equational Matching. Miki Hermann, Phokion G. Kolaitis. J. Symb. Comput. (20): 343-362 (1995). Web SearchBibTeXDownload

Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract). Miki Hermann, Phokion G. Kolaitis. MFCS 1995, 359-370. Web SearchBibTeXDownload

Combinatorial Games In Database Theory. Phokion G. Kolaitis. PODS 1995, 231-232. Web SearchBibTeXDownload

1994

The Complexity of Counting Problems in Equational Matching. Miki Hermann, Phokion G. Kolaitis. CADE 1994, 560-574. Web SearchBibTeXDownload

Logical Definability of NP Optimization Problems. Phokion G. Kolaitis, Madhukar N. Thakur. Inf. Comput. (115): 321-353 (1994). Web SearchBibTeXDownload

How to Define a Linear Order on Finite Models. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto. LICS 1994, 40-49. Web SearchBibTeXDownload

Can Datalog be Approximated?. Surajit Chaudhuri, Phokion G. Kolaitis. PODS 1994, 86-96. Web SearchBibTeX

1993

A Tutorial on Finite Model Theory (Abstract). Phokion G. Kolaitis. LICS 1993, 122. Web SearchBibTeX

Polynomial-time Optimization, Parallel Approximation, and Fixpoint Logic (Extended Abstract). Phokion G. Kolaitis, Madhukar N. Thakur. Structure in Complexity Theory Conference 1993, 31-41. Web SearchBibTeX

1992

Infinitary Logic for Computer Science. Phokion G. Kolaitis, Moshe Y. Vardi. ICALP 1992, 450-473. Cited by 5Web SearchBibTeXDownload

Infinitary Logics and 0-1 Laws. Phokion G. Kolaitis, Moshe Y. Vardi. Inf. Comput. (98): 258-294 (1992). Cited by 41Web SearchBibTeXDownload

Fixpoint Logic vs. Infinitary Logic in Finite-Model Theory. Phokion G. Kolaitis, Moshe Y. Vardi. LICS 1992, 46-57. Cited by 73Web SearchBibTeXDownload

Generalized Quantifiers and Pebble Games on Finite Structures. Phokion G. Kolaitis, Jouko A. Väänänen. LICS 1992, 348-359. Web SearchBibTeXDownload

1991

The Expressive Power of Stratified Programs. Phokion G. Kolaitis. Inf. Comput. (90): 50-66 (1991). Web SearchBibTeXDownload

Why not Negation by Fixpoint?. Phokion G. Kolaitis, Christos H. Papadimitriou. J. Comput. Syst. Sci. (43): 125-144 (1991). Web SearchBibTeXDownload

Approximation Properties of NP Minimization Classes. Phokion G. Kolaitis, Madhukar N. Thakur. Structure in Complexity Theory Conference 1991, 353-366. Web SearchBibTeX

1990

0-1 Laws and Decision Problems for Fragments of Second-Order Logic. Phokion G. Kolaitis, Moshe Y. Vardi. Inf. Comput. (87): 301-337 (1990). Cited by 88Web SearchBibTeXDownload

Some Computational Aspects of Circumscription. Phokion G. Kolaitis, Christos H. Papadimitriou. J. ACM (37): 1-14 (1990). Web SearchBibTeXDownload

Implicit Definability on Finite Structures and Unambiguous Computations (Preliminary Report). Phokion G. Kolaitis. LICS 1990, 168-180. Web SearchBibTeXDownload

0-1 Laws for Infinitary Logics (Preliminary Report). Phokion G. Kolaitis, Moshe Y. Vardi. LICS 1990, 156-167. Web SearchBibTeXDownload

On the Expressive Power of Datalog: Tools and a Case Study. Phokion G. Kolaitis, Moshe Y. Vardi. PODS 1990, 61-71. Cited by 121Web SearchBibTeX

1988

Some Computational Aspects of Circumscription. Phokion G. Kolaitis, Christos H. Papadimitriou. AAAI 1988, 455-469. Web SearchBibTeX

0-1 Laws and Decision Problems for Fragments of Second-Order Logic. Phokion G. Kolaitis, Moshe Y. Vardi. LICS 1988, 2-11. Cited by 88Web SearchBibTeXDownload

Why Not Negation by Fixpoint?. Phokion G. Kolaitis, Christos H. Papadimitriou. PODS 1988, 231-239. Web SearchBibTeX

1987

The Decision Problem for the Probabilities of Higher-Order Properties. Phokion G. Kolaitis, Moshe Y. Vardi. STOC 1987, 425-435. Cited by 87Web SearchBibTeXDownload

1985

On Asymptotic Probability of Inductive Queries and Their Decision Problem. Phokion G. Kolaitis. Logic of Programs 1985, 153-166. Web SearchBibTeXDownload

1979

Recursion in a Quantifier vs. Elementary Induction. Phokion G. Kolaitis. J. Symb. Log. (44): 235-259 (1979). Web SearchBibTeX

SIGMOD 2008 (Chair)^[1]
SIGMOD 2008 (Chair)^[2]
SIGMOD 2007 (Session Chair)^[3]
SIGMOD 2005 (Session Chair)^[4]

Phokion G. Kolaitis

Related People

Related Topics

Services

Related Organizations

Tutorials

1.	^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-21 - details Original context from http://www.sigmod08.org/program_glance.shtml ...Answering Aggregate Queries in Data Exchange Foto Afrati (National Technical University of Athens), Phokion G. Kolaitis (IBM Almaden) Data Exchange and Schema Mappings in Open and Closed Worlds Leonid Libkin and Cristin...
2.	^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-22 - details Original context from http://www.sigmod08.org/program_glance.shtml ...Lohman (IBM Almaden) Interactive Generation of Integrated Schemas Laura Chiticariu (UC Santa Cruz), Phokion G. Kolaitis , Lucian Popa (IBM Almaden) Pay-as-you-go User Feedback for Dataspace Systems Shawn R. Jeffery, Mich...
3.	^ ACM SIGMOD/PODS 2007 Conference - Retrieved 2010-12-11 - details Original context from http://sigmod07.riit.tsinghua.edu.cn/podsProgram.shtml ...obabilistic Data: Foundations and Challenges Location: Convention Hall No.2: 2A - 2C Session Chair: Phokion Kolaitis Speaker: Dan Suciu (University of Washington) ...
4.	^ Untitled Document - Retrieved 2011-02-11 - details Original context from http://cimic.rutgers.edu/~sigmod05/PODSprogram.htm ...ational Technical University of Athens, Greece Schema Mappings, Data Exchange & Metadata Management Phokion Kolaitis (IBM Almaden Research Center & UC Santa Cruz) Session Chair: Georg Gottlob, Vienna University of Te...
5.	^ Untitled Document - Retrieved 2011-02-11 - details Original context from http://cimic.rutgers.edu/~sigmod05/PODSkeynote.htm ... Phokion G. Kolaitis IBM Almaden Research Center and UC Santa Cruz Schema Mappings, Data Exchange, and Metadata Manageme...
6.	^ SIGMOD/PODS 2003 Conference - Retrieved 2011-03-19 - details Original context from http://db.ucsd.edu/SIGMODPODS03/PODSpapers.html ... Ronald Fagin, Phokion G. Kolaitis , Lucian Popa ...