default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicole Schweikardt
- > Home > Persons > Nicole Schweikardt
Publications
- 2018
[c46]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. PODS 2018: 253-266- 2017
- [i16]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. CoRR abs/1707.05945 (2017) - 2014
- [c37]André Frochaux, Martin Grohe, Nicole Schweikardt:
Monadic Datalog Containment on Trees. AMW 2014 - [i13]André Frochaux, Martin Grohe, Nicole Schweikardt:
Monadic Datalog Containment on Trees. CoRR abs/1404.0606 (2014) - 2009
- [j13]Martin Grohe
, André Hernich, Nicole Schweikardt:
Lower bounds for processing data with few random accesses to external memory. J. ACM 56(3): 12:1-12:58 (2009) - [j12]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - 2007
- [j8]Martin Grohe, Christoph Koch, Nicole Schweikardt:
Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. 380(1-2): 199-217 (2007) - [c20]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Model Theory Makes Formulas Large. ICALP 2007: 913-924 - [c19]Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche:
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [i7]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized Computations on Large Data Sets: Tight Lower Bounds. CoRR abs/cs/0703081 (2007) - 2006
- [c16]Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420 - [c15]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized computations on large data sets: tight lower bounds. PODS 2006: 243-252 - 2005
- [j5]Martin Grohe, Nicole Schweikardt:
The succinctness of first-order logic on linear orders. Log. Methods Comput. Sci. 1(1) (2005) - [c14]Martin Grohe, Christoph Koch, Nicole Schweikardt:
The Complexity of Querying External Memory and Streaming Data. FCT 2005: 1-16 - [c13]Martin Grohe, Christoph Koch, Nicole Schweikardt:
Tight Lower Bounds for Query Processing on Streaming and External Memory Data. ICALP 2005: 1076-1088 - [c12]Martin Grohe, Stephan Kreutzer, Nicole Schweikardt:
The Expressive Power of Two-Variable Least Fixed-Point Logics. MFCS 2005: 422-434 - [c11]Martin Grohe, Nicole Schweikardt:
Lower bounds for sorting with few random accesses to external memory. PODS 2005: 238-249 - [i5]Martin Grohe, Nicole Schweikardt:
The succinctness of first-order logic on linear orders. CoRR abs/cs/0502047 (2005) - [i4]Martin Grohe, Christoph Koch, Nicole Schweikardt:
Tight Lower Bounds for Query Processing on Streaming and External Memory Data. CoRR abs/cs/0505002 (2005) - 2004
- [j2]Martin Grohe, Nicole Schweikardt:
Comparing the succinctness of monadic query languages over finite trees. RAIRO Theor. Informatics Appl. 38(4): 343-373 (2004) - [c9]Martin Grohe, Nicole Schweikardt:
The Succinctness of First-Order Logic on Linear Orders. LICS 2004: 438-447 - 2003
- [c6]Martin Grohe, Nicole Schweikardt:
Comparing the Succinctness of Monadic Query Languages over Finite Trees. CSL 2003: 226-240
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-20 22: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:
