default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStavros S. Cosmadakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Stavros S. Cosmadakis
, Dimitris J. Kavvadias, Lina Panagopoulou:
Resolution based algorithms for the transversal hypergraph generation problem. Theor. Comput. Sci. 815: 1-10 (2020)
2010 – 2019
- 2010
- [j14]Stavros S. Cosmadakis, Eugénie Foustoucos, Anastasios Sidiropoulos:
Undecidability and intractability results concerning datalog programs and their persistency numbers. ACM Trans. Comput. Log. 11(2): 12:1-12:29 (2010)
2000 – 2009
- 2005
- [j13]Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos:
Datalog programs and their persistency numbers. ACM Trans. Comput. Log. 6(3): 481-518 (2005) - 2002
- [j12]Stavros S. Cosmadakis:
Inherent Complexity of Recursive Queries. J. Comput. Syst. Sci. 64(3): 466-495 (2002) - 2001
- [j11]Stavros S. Cosmadakis, Gabriel M. Kuper, Leonid Libkin:
On the orthographic dimension of definable sets. Inf. Process. Lett. 79(3): 141-145 (2001) - [c23]Stavros S. Cosmadakis, Kleoni Ioannidou, Stergios Stergiou:
View Serializable Updates of Concurrent Index Structures. DBPL 2001: 247-262
1990 – 1999
- 1999
- [c22]Vasilis Aggelis, Stavros S. Cosmadakis:
Optimization of Nested SQL Queries by Tableau Equivalence. DBPL 1999: 31-42 - [c21]Stavros S. Cosmadakis:
Inherent Complexity of Recursive Queries (Extended Abstract). PODS 1999: 148-154 - 1995
- [j10]Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis:
On Datalog vs. Polynomial Time. J. Comput. Syst. Sci. 51(2): 177-196 (1995) - 1994
- [c20]Stavros S. Cosmadakis:
Complete Proof Systems for Algebraic Simply-Typed Terms. LISP and Functional Programming 1994: 220-226 - [c19]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
- [c18]Stavros S. Cosmadakis:
Logical Reducibility and Monadic NP. FOCS 1993: 52-61 - 1991
- [c17]Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis:
On Datalog vs. Polynomial Time. PODS 1991: 13-25 - 1990
- [j9]Stavros S. Cosmadakis, Paris C. Kanellakis, Moshe Y. Vardi:
Polynomial-Time Implication Problems for Unary Inclusion Dependencies. J. ACM 37(1): 15-46 (1990) - [c16]Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke:
Completeness for typed lazy inequalities. LICS 1990: 312-320
1980 – 1989
- 1989
- [c15]Stavros S. Cosmadakis:
Computing with Recursive Types (Extended Abstract). LICS 1989: 24-38 - [c14]Stavros S. Cosmadakis:
On the First-Order Expressibility of Recursive Queries. PODS 1989: 311-323 - [c13]Foto N. Afrati, Stavros S. Cosmadakis:
Expressiveness of Restricted Recursive Queries (Extended Abstract). STOC 1989: 113-126 - 1988
- [j8]Stavros S. Cosmadakis:
The Word and Generator Problems for Lattices. Inf. Comput. 77(3): 192-217 (1988) - [c12]Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi:
Decidable Optimization Problems for Database Logic Programs (Preliminary Report). STOC 1988: 477-490 - 1987
- [j7]Sandeep N. Bhatt, Stavros S. Cosmadakis:
The Complexity of Minimizing Wire Lengths in VLSI Layouts. Inf. Process. Lett. 25(4): 263-267 (1987) - [c11]Stavros S. Cosmadakis:
Database Theory and Cylindric Lattices (Extended Abstract). FOCS 1987: 411-420 - 1986
- [j6]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies. Adv. Comput. Res. 3: 163-184 (1986) - [j5]Foto N. Afrati, Stavros S. Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou:
The Complexity of the Travelling Repairman Problem. RAIRO Theor. Informatics Appl. 20(1): 79-87 (1986) - [j4]Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
Partition Semantics for Relations. J. Comput. Syst. Sci. 33(2): 203-233 (1986) - [c10]Stavros S. Cosmadakis, Paris C. Kanellakis:
Parallel Evaluation of Recursive Rule Queries. PODS 1986: 280-293 - 1985
- [c9]Stavros S. Cosmadakis, Paris C. Kanellakis, Nicolas Spyratos:
Partition Semantics for Relations. PODS 1985: 261-275 - [c8]Stavros S. Cosmadakis, Paris C. Kanellakis:
Two Applications of Equational Theories to Database Theory. RTA 1985: 107-123 - [c7]Stavros S. Cosmadakis, Paris C. Kanellakis:
Equational Theories and Database Constraints. STOC 1985: 273-284 - 1984
- [j3]Stavros S. Cosmadakis, Christos H. Papadimitriou:
Updates of Relational Views. J. ACM 31(4): 742-760 (1984) - [j2]Stavros S. Cosmadakis, Christos H. Papadimitriou:
The Traveling Salesman Problem with Many Visits to Few Cities. SIAM J. Comput. 13(1): 99-108 (1984) - [c6]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies: A Graph Theoretic Approach. PODS 1984: 29-37 - 1983
- [j1]Stavros S. Cosmadakis:
The Complexity of Evaluating Relational Queries. Inf. Control. 58(1-3): 101-112 (1983) - [c5]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 - [c4]Stavros S. Cosmadakis:
The Complexity of Evaluating Relational Queries. PODS 1983: 149-155 - [c3]Stavros S. Cosmadakis, Christos H. Papadimitriou:
Updates of Relational Views. PODS 1983: 317-331 - [c2]Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi:
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract). STOC 1983: 264-277 - [c1]Stavros S. Cosmadakis, Paris C. Kanellakis:
Functional and Inclusion Dependencies. XP4.5 Workshop on Database Theory 1983
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
