Stavros S. Cosmadakis

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