The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stavros S. Cosmadakis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002