 | 
| |
Online DBLP entries are available for Phokion G. Kolaitis and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Phokion G. Kolaitis,
Moshe
Y. Vardi: Conjunctive-Query Containment and Constraint Satisfaction.
PODS
1998: 205-213
-
Miki
Hermann, Phokion G. Kolaitis: On the Complexity of Unification and
Disunification in Commutative Idempotent Semigroups.
CP
1997: 282-296
-
Surajit
Chaudhuri, Phokion G. Kolaitis: Can Datalog Be Approximated?
JCSS
55(2): 355-369 (1997)
-
Miki
Hermann, Phokion G. Kolaitis: Unification Algorithms Cannot be Combined
in Polynomial Time.
CADE
1996: 246-260
-
Phokion G. Kolaitis,
Moshe
Y. Vardi: On the Expressive Power of Variable-Confined Logics.
LICS
1996: 348-359
-
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,
Madhukar
N. Thakur: Approximation Properties of NP Minimization Classes.
JCSS
50(3): 391-411 (1995)
-
Phokion G. Kolaitis,
Moshe
Y. Vardi: On the Expressive Power of Datalog: Tools and a Case Study.
JCSS
51(1): 110-134 (1995)
-
Miki
Hermann, Phokion G. Kolaitis: The Complexity of Counting Problems in
Equational Matching.
JSC
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.
Information
and Computation 115(2): 321-353 (1994)
-
Phokion G. Kolaitis: A Tutorial on Finite Model Theory (Abstract).
LICS
1993: 122
-
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.
Information
and Computation 98(2): 258-294 (1992)
-
Phokion G. Kolaitis: The Expressive Power of Stratified Programs.
Information
and Computation 90(1): 50-66 (1991)
-
Phokion G. Kolaitis,
Christos
H. Papadimitriou: Why not Negation by Fixpoint?
JCSS
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.
Information
and Computation 87(1/2): 301-337 (1990)
-
Phokion G. Kolaitis,
Christos
H. Papadimitriou: Some Computational Aspects of Circumscription.
JACM
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
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
