default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Benedikt
- > Home > Persons > Michael Benedikt
Publications
- 2007
[j16]Michael Benedikt
, Leonid Libkin, Frank Neven:
Logical definability and query languages over ranked and unranked trees. ACM Trans. Comput. Log. 8(2): 11 (2007)- 2003
- [j11]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - [j10]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. 66(1): 169-206 (2003) - 2002
- [j8]Michael Benedikt, Leonid Libkin:
Aggregate Operators in Constraint Query Languages. J. Comput. Syst. Sci. 64(3): 628-654 (2002) - [c18]Michael Benedikt, Leonid Libkin:
Tree Extension Algebras: Logics, Automata, and Query Languages. LICS 2002: 203- - 2001
- [c15]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440 - [c14]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
String Operations in Query Languages. PODS 2001 - 2000
- [j7]Michael Benedikt, Leonid Libkin:
Relational queries over interpreted structures. J. ACM 47(4): 644-680 (2000) - [j6]Michael Benedikt, Leonid Libkin:
Safe Constraint Queries. SIAM J. Comput. 29(5): 1652-1682 (2000) - [c12]Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin:
Reachability and Connectivity Queries in Constraint Databases. PODS 2000: 104-115 - [p2]Michael Benedikt, Leonid Libkin:
Expressive Power: The Finite Case. Constraint Databases 2000: 55-87 - [p1]Michael Benedikt, Leonid Libkin:
Query Safety with Constraints. Constraint Databases 2000: 109-129 - 1999
- [c10]Michael Benedikt, Leonid Libkin:
Exact and Approximate Aggregation in Constraint Query. PODS 1999: 102-113 - 1998
- [j4]Michael Benedikt, Timothy Griffin, Leonid Libkin:
Verifiable Properties of Database Transactions. Inf. Comput. 147(1): 57-88 (1998) - [j3]Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. J. ACM 45(1): 1-34 (1998) - [c8]Michael Benedikt, Leonid Libkin:
Safe Constraint Queries. PODS 1998: 99-108 - 1997
- [c4]Michael Benedikt, Leonid Libkin:
Languages for Relational Databases over Interpreted Structures. PODS 1997: 87-98 - 1996
- [c3]Michael Benedikt, Leonid Libkin:
On the Structure of Queries in Constraint Query Languages. LICS 1996: 25-34 - [c2]Michael Benedikt, Guozhu Dong, Leonid Libkin, Limsoon Wong:
Relational Expressive Power of Constraint Query Languages. PODS 1996: 5-16 - [c1]Michael Benedikt, Timothy Griffin, Leonid Libkin:
Verifiable Properties of Database Transactions. PODS 1996: 117-127
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-08-29 21:53 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:
