dblp.uni-trier.dewww.uni-trier.de

Stavros S. Cosmadakis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2005
36EEFoto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos: Datalog programs and their persistency numbers. ACM Trans. Comput. Log. 6(3): 481-518 (2005)
2002
35EEStavros S. Cosmadakis: Inherent Complexity of Recursive Queries. J. Comput. Syst. Sci. 64(3): 466-495 (2002)
2001
34EEStavros S. Cosmadakis, Kleoni Ioannidou, Stergios Stergiou: View Serializable Updates of Concurrent Index Structures. DBPL 2001: 247-262
33EEStavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin: On the orthographic dimension of definable sets. Inf. Process. Lett. 79(3): 141-145 (2001)
1999
32EEVasilis Aggelis, Stavros S. Cosmadakis: Optimization of Nested SQL Queries by Tableau Equivalence. DBPL 1999: 31-42
31EEStavros S. Cosmadakis: Inherent Complexity of Recursive Queries (Extended Abstract). PODS 1999: 148-154
1995
30 Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51(2): 177-196 (1995)
1994
29EEStavros S. Cosmadakis: Complete Proof Systems for Algebraic Simply-Typed Terms. LISP and Functional Programming 1994: 220-226
28 Foto N. Afrati, Stavros S. Cosmadakis, Stéphane Grumbach, Gabriel M. Kuper: Linear vs Polynomial Constraints in Database Query Languages. PPCP 1994: 181-192
1993
27 Stavros S. Cosmadakis: Logical Reducibility and Monadic NP FOCS 1993: 52-61
1991
26EEFoto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis: On Datalog vs. Polynomial Time. PODS 1991: 13-25
1990
25 Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke: Completeness for typed lazy inequalities LICS 1990: 312-320
24EEStavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi: Polynomial-Time Implication Problems for Unary Inclusion Dependencies J. ACM 37(1): 15-46 (1990)
1989
23 Stavros S. Cosmadakis: Computing with Recursive Types (Extended Abstract) LICS 1989: 24-38
22EEStavros S. Cosmadakis: On the First-Order Expressibility of Recursive Queries. PODS 1989: 311-323
21 Foto N. Afrati, Stavros S. Cosmadakis: Expressiveness of Restricted Recursive Queries (Extended Abstract) STOC 1989: 113-126
1988
20 Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi: Decidable Optimization Problems for Database Logic Programs (Preliminary Report) STOC 1988: 477-490
19 Stavros S. Cosmadakis: The Word and Generator Problems for Lattices Inf. Comput. 77(3): 192-217 (1988)
1987
18 Stavros S. Cosmadakis: Database Theory and Cylindric Lattices (Extended Abstract) FOCS 1987: 411-420
17 Sandeep N. Bhatt, Stavros S. Cosmadakis: The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inf. Process. Lett. 25(4): 263-267 (1987)
1986
16EEStavros S. Cosmadakis, Paris C. Kanellakis: Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293
15 Stavros S. Cosmadakis, Paris C. Kanellakis: Functional and Inclusion Dependencies. Advances in Computing Research 3: 163-184 (1986)
14 Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou: The Complexity of the Travelling Repairman Problem. ITA 20(1): 79-87 (1986)
13 Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233 (1986)
1985
12EEStavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos: Partition Semantics for Relations. PODS 1985: 261-275
11EEStavros S. Cosmadakis, Paris C. Kanellakis: Two Applications of Equational Theories to Database Theory. RTA 1985: 107-123
10 Stavros S. Cosmadakis, Paris C. Kanellakis: Equational Theories and Database Constraints STOC 1985: 273-284
1984
9EEStavros S. Cosmadakis, Paris C. Kanellakis: Functional and Inclusion Dependencies: A Graph Theoretic Approach. PODS 1984: 29-37
8EEStavros S. Cosmadakis, Christos H. Papadimitriou: Updates of Relational Views. J. ACM 31(4): 742-760 (1984)
7 Stavros S. Cosmadakis, Christos H. Papadimitriou: The Traveling Salesman Problem with Many Visits to Few Cities. SIAM J. Comput. 13(1): 99-108 (1984)
1983
6EEMihalis 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
5EEStavros S. Cosmadakis: The Complexity of Evaluating Relational Queries. PODS 1983: 149-155
4EEStavros S. Cosmadakis, Christos H. Papadimitriou: Updates of Relational Views. PODS 1983: 317-331
3 Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi: Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) STOC 1983: 264-277
2 Stavros S. Cosmadakis, Paris C. Kanellakis: Functional and Inclusion Dependencies. XP4.5 Workshop on Database Theory 1983
1 Stavros S. Cosmadakis: The Complexity of Evaluating Relational Queries Information and Control 58(1-3): 101-112 (1983)

Coauthor Index

1Foto N. Afrati [14] [21] [26] [28] [30] [36]
2Vasilis Aggelis [32]
3Sandeep N. Bhatt [17]
4Eugénie Foustoucos [36]
5Haim Gaifman [20]
6Stéphane Grumbach [28]
7Kleoni Ioannidou [34]
8Paris C. Kanellakis [2] [3] [6] [9] [10] [11] [12] [13] [15] [16] [20] [24]
9Gabriel M. Kuper [28] [33]
10Leonid Libkin [33]
11Albert R. Meyer [25]
12Christos H. Papadimitriou [4] [6] [7] [8] [14]
13George Papageorgiou [14]
14Nadia Papakostantinou [14]
15Jon G. Riecke [25]
16Nicolas Spyratos [12] [13]
17Stergios Stergiou [34]
18Moshe Y. Vardi [3] [20] [24]
19Mihalis Yannakakis [6] [26] [30]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)