| 
| |  | |  |
Inherent Complexity of Recursive Queries (Extended Abstract)
Note: Links lead to the DBLP on the Web.
Stavros S. Cosmadakis
29
Stavros S. Cosmadakis: Inherent Complexity of Recursive Queries (Extended Abstract).
PODS 1999
: 148-154
28
Foto N. Afrati
, Stavros S. Cosmadakis,
Mihalis Yannakakis
: On Datalog vs. Polynomial Time.
JCSS 51
(2): 177-196 (1995)
27
Stavros S. Cosmadakis: Complete Proof Systems for Algebraic Simply-Typed Terms.
LISP and Functional Programming 1994
: 220-226
26
Foto N. Afrati
, Stavros S. Cosmadakis,
Stéphane Grumbach
,
Gabriel M. Kuper
: Linear vs Polynomial Constraints in Database Query Languages.
PPCP 1994
: 181-192
25
Stavros S. Cosmadakis: Logical Reducibility and Monadic NP.
FOCS 1993
: 52-61
24
Foto N. Afrati
, Stavros S. Cosmadakis,
Mihalis Yannakakis
: On Datalog vs. Polynomial Time.
PODS 1991
: 13-25
23
Stavros S. Cosmadakis,
Albert R. Meyer
,
Jon G. Riecke
: Completeness for typed lazy inequalities.
LICS 1990
: 312-320
22
Stavros S. Cosmadakis,
Paris C. Kanellakis
,
Moshe Y. Vardi
: Polynomial-Time Implication Problems for Unary Inclusion Dependencies.
JACM 37
(1): 15-46 (1990)
21
Stavros S. Cosmadakis: Computing with Recursive Types (Extended Abstract).
LICS 1989
: 24-38
20
Stavros S. Cosmadakis: On the First-Order Expressibility of Recursive Queries.
PODS 1989
: 311-323
19
Foto N. Afrati
, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract).
STOC 1989
: 113-126
18
Stavros S. Cosmadakis,
Haim Gaifman
,
Paris C. Kanellakis
,
Moshe Y. Vardi
: Decidable Optimization Problems for Database Logic Programs (Preliminary Report).
STOC 1988
: 477-490
17
Stavros S. Cosmadakis: The Word and Generator Problems for Lattices.
Information and Computation 77
(3): 192-217 (1988)
16
Stavros S. Cosmadakis: Database Theory and Cylindric Lattices (Extended Abstract).
FOCS 1987
: 411-420
15
Sandeep N. Bhatt
, Stavros S. Cosmadakis: The Complexity of Minimizing Wire Lengths in VLSI Layouts.
IPL 25
(4): 263-267 (1987)
14
Stavros S. Cosmadakis,
Paris C. Kanellakis
: Parallel Evaluation of Recursive Rule Queries.
PODS 1986
: 280-293
13
Stavros S. Cosmadakis,
Paris C. Kanellakis
: Functional and Inclusion Dependencies.
Advances in Computing Research 3
: 163-184 (1986)
12
Stavros S. Cosmadakis,
Paris C. Kanellakis
,
Nicolas Spyratos
: Partition Semantics for Relations.
JCSS 33
(2): 203-233 (1986)
11
Stavros S. Cosmadakis,
Paris C. Kanellakis
,
Nicolas Spyratos
: Partition Semantics for Relations.
PODS 1985
: 261-275
10
Stavros S. Cosmadakis,
Paris C. Kanellakis
: Two Applications of Equational Theories to Database Theory.
RTA 1985
: 107-123
9
Stavros S. Cosmadakis,
Paris C. Kanellakis
: Equational Theories and Database Constraints.
STOC 1985
: 273-284
8
Stavros S. Cosmadakis,
Paris C. Kanellakis
: Functional and Inclusion Dependencies: A Graph Theoretic Approach.
PODS 1984
: 29-37
7
Stavros S. Cosmadakis,
Christos H. Papadimitriou
: Updates of Relational Views.
JACM 31
(4): 742-760 (1984)
6
Stavros S. Cosmadakis,
Christos H. Papadimitriou
: The Traveling Salesman Problem with Many Visits to Few Cities.
SIAM J. Comput. 13
(1): 99-108 (1984)
5
Mihalis Yannakakis
,
Paris C. Kanellakis
, Stavros S. Cosmadakis,
Christos H. Papadimitriou
: Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract).
ICALP 1983
: 712-722
4
Stavros S. Cosmadakis: The Complexity of Evaluating Relational Queries.
PODS 1983
: 149-155
3
Stavros S. Cosmadakis,
Christos H. Papadimitriou
: Updates of Relational Views.
PODS 1983
: 317-331
2
Paris C. Kanellakis
, Stavros S. Cosmadakis,
Moshe Y. Vardi
: Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract).
STOC 1983
: 264-277
1
Stavros S. Cosmadakis: The Complexity of Evaluating Relational Queries.
Information and Control 58
(1-3): 101-112 (1983)
Copyright(C) 2000 ACM | | | | | | |
