default search action
Nicole Schweikardt
Person information
- affiliation: Humboldt University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j29]Markus L. Schmid, Nicole Schweikardt:
Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners. Log. Methods Comput. Sci. 20(4) (2024) - [e16]Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Maike Buchin, Anna Förster, Felix C. Freiling, Jan Mendling, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Ingo Scholtes, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2023. LNI D-24, GI 2024 [contents] - [i31]Cristian Riveros, Markus L. Schmid, Nicole Schweikardt:
A framework for extraction and transformation of documents. CoRR abs/2405.12350 (2024) - [i30]Cristian Riveros, Benjamin Scheidt, Nicole Schweikardt:
Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas. CoRR abs/2405.12358 (2024) - [i29]Benjamin Scheidt, Nicole Schweikardt:
Color Refinement for Relational Structures. CoRR abs/2407.16022 (2024) - 2023
- [c62]Sarah Kleest-Meißner, Rebecca Sattler
, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich:
Discovering Multi-Dimensional Subsequence Queries from Traces - From Theory to Practice. BTW 2023: 511-533 - [c61]Benjamin Scheidt
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. MFCS 2023: 79:1-79:15 - [e15]Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2022. LNI D-23, GI 2023 [contents] - [i28]Benjamin Scheidt, Nicole Schweikardt:
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. CoRR abs/2303.10980 (2023) - 2022
- [j28]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM 69(3): 22:1-22:37 (2022) - [j27]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. 18(2) (2022) - [j26]Nofar Carmeli
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Trans. Database Syst. 47(3): 9:1-9:49 (2022) - [c60]Sarah Kleest-Meißner
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. ICDT 2022: 18:1-18:21 - [c59]Markus L. Schmid, Nicole Schweikardt:
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. PODS 2022: 79-89 - [c58]Markus L. Schmid, Nicole Schweikardt:
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. PODS 2022: 139-150 - [e14]Steffen Hölldobler, Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2021. LNI D-22, GI 2022, ISBN 978-3-88579-980-1 [contents] - 2021
- [j25]Ulf Leser, Marcus Hilbrich
The Collaborative Research Center FONDA. Datenbank-Spektrum 21(3): 255-260 (2021) - [c57]Steffen van Bergerem
Learning Concepts Described By Weight Aggregation Logic. CSL 2021: 10:1-10:18 - [c56]Nicole Schweikardt:
Locality Properties of Extensions of First-Order Logic and their Use in Algorithms (Abstract of Invited Talk). Description Logics 2021 - [c55]Markus L. Schmid, Nicole Schweikardt:
A Purely Regular Approach to Non-Regular Core Spanners. ICDT 2021: 4:1-4:19 - [c54]Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. PODS 2021: 153-165 - [e13]Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2020. LNI D-21, GI 2021, ISBN 978-3-88579-775-3 [contents] - [i27]Markus L. Schmid, Nicole Schweikardt:
Spanner Evaluation over SLP-Compressed Documents. CoRR abs/2101.10890 (2021) - 2020
- [j24]Christoph Berkholz, Fabian Gerhardt, Nicole Schweikardt:
Constant delay enumeration for conjunctive queries: a tutorial. ACM SIGLOG News 7(1): 4-33 (2020) - [c53]Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. PODS 2020: 393-409 - [e12]Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2019. LNI D-20, GI 2020, ISBN 978-3-88579-775-3 [contents] - [i26]Christoph Berkholz, Nicole Schweikardt:
Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width. CoRR abs/2003.01075 (2020) - [i25]Steffen van Bergerem, Nicole Schweikardt:
Learning Concepts Described by Weight Aggregation Logic. CoRR abs/2009.10574 (2020) - [i24]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR abs/2010.08382 (2020) - [i23]Markus L. Schmid, Nicole Schweikardt:
A Purely Regular Approach to Non-Regular Core Spanners. CoRR abs/2010.13442 (2020)
2010 – 2019
- 2019
- [c52]Nicole Schweikardt:
Local normal forms and their use in algorithmic meta theorems (Invited Talk). LICS 2019: 1-3 - [c51]Christoph Berkholz, Nicole Schweikardt:
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. MFCS 2019: 58:1-58:15 - [e11]Sven Apel, Abraham Bernstein, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2018. LNI D-19, GI 2019, ISBN 978-3-88579-977-1 [contents] - [i22]Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt:
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. CoRR abs/1912.10704 (2019) - [i21]Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt:
Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports 9(5): 89-109 (2019) - 2018
- [j23]Frank Neven
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19(2): 14:1-14:37 (2018) - [j22]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering FO+MOD Queries under Updates on Bounded Degree Databases. ACM Trans. Database Syst. 43(2): 7:1-7:32 (2018) - [c50]Dietrich Kuske, Nicole Schweikardt:
Gaifman Normal Forms for Counting Extensions of First-Order Logic. ICALP 2018: 133:1-133:14 - [c49]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering UCQs under Updates and in the Presence of Integrity Constraints. ICDT 2018: 8:1-8:19 - [c48]Maurizio Lenzerini, Wim Martens, Nicole Schweikardt:
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2018: 105 - [c47]Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
Enumeration for FO Queries over Nowhere Dense Graphs. PODS 2018: 151-163 - [c46]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. PODS 2018: 253-266 - [e10]Sven Apel, Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Björn Scheuermann, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2017. LNI D-18, GI 2018, ISBN 978-3-88579-977-1 [contents] - [r6]Nicole Schweikardt:
Ehrenfeucht-Fraïssé Games. Encyclopedia of Database Systems (2nd ed.) 2018 - [r5]Nicole Schweikardt:
One-Pass Algorithm. Encyclopedia of Database Systems (2nd ed.) 2018 - [r4]Nicole Schweikardt:
Zero-One Laws. Encyclopedia of Database Systems (2nd ed.) 2018 - [i20]Jörg P. Bachmann, Johann-Christoph Freytag, Benjamin Hauskeller, Nicole Schweikardt:
Measuring Congruence on High Dimensional Time Series. CoRR abs/1805.10697 (2018) - 2017
- [c45]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering FO+MOD Queries Under Updates on Bounded Degree Databases. ICDT 2017: 8:1-8:18 - [c44]Dietrich Kuske, Nicole Schweikardt:
First-order logic with counting. LICS 2017: 1-12 - [c43]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering Conjunctive Queries under Updates. PODS 2017: 303-318 - [e9]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2016. LNI D-17, GI 2017, ISBN 978-3-88579-976-4 [contents] - [i19]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering Conjunctive Queries under Updates. CoRR abs/1702.06370 (2017) - [i18]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering FO+MOD queries under updates on bounded degree databases. CoRR abs/1702.08764 (2017) - [i17]Dietrich Kuske, Nicole Schweikardt:
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! CoRR abs/1703.01122 (2017) - [i16]Martin Grohe, Nicole Schweikardt:
First-Order Query Evaluation with Cardinality Conditions. CoRR abs/1707.05945 (2017) - [i15]Christoph Berkholz, Jens Keppeler, Nicole Schweikardt:
Answering UCQs under updates and in the presence of integrity constraints. CoRR abs/1709.10039 (2017) - 2016
- [j21]Frederik Harwath, Nicole Schweikardt:
On the locality of arb-invariant first-order formulas with modulo counting quantifiers. Log. Methods Comput. Sci. 12(4) (2016) - [c42]André Frochaux, Nicole Schweikardt:
Monadic Datalog Containment on Trees Using the Descendant-Axis. AMW 2016 - [c41]Parvaneh Babari
+\omega + ω -Picture Languages Recognizable by Büchi-Tiling Systems. LATA 2016: 76-88 - [c40]Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
Hanf normal form for first-order logic with unary counting quantifiers. LICS 2016: 277-286 - [e8]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2015. LNI D-16, GI 2016, ISBN 978-3-88579-975-7 [contents] - [i14]André Frochaux, Nicole Schweikardt:
Monadic Datalog Containment on Trees Using the Descendant-Axis. CoRR abs/1608.06130 (2016) - 2015
- [j20]Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. Log. Methods Comput. Sci. 11(4) (2015) - [c39]Nicole Schweikardt:
Using Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk). ICDT 2015: 13-14 - [c38]Frank Neven
Distributed Streaming with Finite Memory. ICDT 2015: 324-341 - [e7]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2014. LNI D-15, GI 2015, ISBN 978-3-88579-419-6 [contents] - 2014
- [c37]André Frochaux, Martin Grohe, Nicole Schweikardt:
Monadic Datalog Containment on Trees. AMW 2014 - [c36]Frederik Harwath, Lucas Heimberg, Nicole Schweikardt:
Preservation and decomposition theorems for bounded degree structures. CSL-LICS 2014: 49:1-49:10 - [c35]Stephan Kreutzer, Nicole Schweikardt:
On Hanf-equivalence and the number of embeddings of small induced subgraphs. CSL-LICS 2014: 60:1-60:10 - [c34]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating answers to first-order queries over databases of low degree. PODS 2014: 121-131 - [e6]K. Selçuk Candan, Sihem Amer-Yahia, Nicole Schweikardt, Vassilis Christophides, Vincent Leroy:
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), Athens, Greece, March 28, 2014. CEUR Workshop Proceedings 1133, CEUR-WS.org 2014 [contents] - [e5]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2013. LNI D-14, GI 2014, ISBN 978-3-88579-418-9 [contents] - [e4]Nicole Schweikardt, Vassilis Christophides, Vincent Leroy:
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014. OpenProceedings.org 2014 [contents] - [i13]André Frochaux, Martin Grohe, Nicole Schweikardt:
Monadic Datalog Containment on Trees. CoRR abs/1404.0606 (2014) - 2013
- [j19]Dominik D. Freydenberger
Expressiveness and static analysis of extended conjunctive regular path queries. J. Comput. Syst. Sci. 79(6): 892-909 (2013) - [c33]Frederik Harwath, Nicole Schweikardt:
On the locality of arb-invariant first-order logic with modulo counting quantifiers. CSL 2013: 363-379 - [c32]Nicole Schweikardt:
A Short Tutorial on Order-Invariant First-Order Logic. CSR 2013: 112-126 - [c31]Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. LICS 2013: 63-72 - [e3]Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt:
Data Exchange, Integration, and Streams. Dagstuhl Follow-Ups 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-61-3 [contents] - [i12]André Frochaux, Nicole Schweikardt:
A note on monadic datalog on unranked trees. CoRR abs/1310.1316 (2013) - 2012
- [j18]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. SIAM J. Comput. 41(6): 1481-1523 (2012) - [c30]Nicole Schweikardt:
A Toolkit for Proving Limitations of the Expressive Power of Logics. MFCS 2012: 46-47 - [c29]Frederik Harwath, Nicole Schweikardt:
Regular tree languages, cardinality predicates, and addition-invariant FO. STACS 2012: 489-500 - [c28]Nicole Schweikardt:
On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates. WoLLIC 2012: 85-87 - [e2]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2012. LNI D-13, GI 2012, ISBN 978-3-88579-417-2 [contents] - 2011
- [j17]Nicole Schweikardt, Thomas Schwentick:
A note on the expressive power of linear orders. Log. Methods Comput. Sci. 7(4) (2011) - [j16]Phokion G. Kolaitis, Maurizio Lenzerini
Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). SIGMOD Rec. 40(1): 40-42 (2011) - [j15]André Hernich, Leonid Libkin
Closed world data exchange. ACM Trans. Database Syst. 36(2): 14:1-14:40 (2011) - [c27]Dominik D. Freydenberger, Nicole Schweikardt:
Expressiveness and Static Analysis of Extended Conjunctive Regular Path Queries. AMW 2011 - [c26]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. ICALP (2) 2011: 368-379 - [i11]Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin:
Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j14]Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick:
Logik und Automaten: ein echtes Dreamteam. Inform. Spektrum 33(5): 452-461 (2010) - [c25]Nicole Schweikardt, Luc Segoufin:
Addition-Invariant FO and Regularity. LICS 2010: 273-282 - [e1]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010. Dagstuhl Seminar Proceedings 10501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i10]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010 - [i9]Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas:
10501 Executive Summary - Advances and Applications of Automata on Words and Trees. Advances and Applications of Automata on Words and Trees 2010
2000 – 2009
- 2009
- [j13]Martin Grohe
Lower bounds for processing data with few random accesses to external memory. J. ACM 56(3): 12:1-12:58 (2009) - [j12]Martin Grohe
Database Query Processing Using Finite Cursor Machines. Theory Comput. Syst. 44(4): 533-560 (2009) - [j11]Nicole Schweikardt:
Machine models for query processing. SIGMOD Rec. 38(2): 18-28 (2009) - [c24]Nicole Schweikardt:
Lower Bounds for Multi-Pass Processing of Multiple Data Streams. STACS 2009: 51-61 - [r3]Nicole Schweikardt:
Ehrenfeucht-Fraïssé Games. Encyclopedia of Database Systems 2009: 963-964 - [r2]Nicole Schweikardt:
One-Pass Algorithm. Encyclopedia of Database Systems 2009: 1948-1949 - [r1]Nicole Schweikardt:
Zero-One Laws. Encyclopedia of Database Systems 2009: 3683 - [i8]Nicole Schweikardt:
Lower Bounds for Multi-Pass Processing of Multiple Data Streams. CoRR abs/0902.1605 (2009) - 2008
- [j10]André Hernich, Nicole Schweikardt:
Reversal complexity revisited. Theor. Comput. Sci. 401(1-3): 191-205 (2008) - [c23]Oliver Matz, Nicole Schweikardt:
Expressive power of monadic logics on words, trees, pictures, and graphs. Logic and Automata 2008: 531-552 - [c22]André Hernich, Nicole Schweikardt:
Logic and Data Exchange: Which Solutions Are "Good" Solutions? LOFT 2008: 61-85 - 2007
- [j9]Nicole Schweikardt:
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory. Inf. Comput. 205(3): 311-379 (2007) - [j8]Martin Grohe
Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. 380(1-2): 199-217 (2007) - [c21]Stephan Kreutzer, Martin Otto, Nicole Schweikardt:
Boundedness of Monadic FO over Acyclic Structures. ICALP 2007: 571-582 - [c20]Anuj Dawar
Model Theory Makes Formulas Large. ICALP 2007: 913-924 - [c19]Martin Grohe
Database Query Processing Using Finite Cursor Machines. ICDT 2007: 284-298 - [c18]Nicole Schweikardt:
Machine models and lower bounds for query processing. PODS 2007: 41-52 - [c17]André Hernich, Nicole Schweikardt:
CWA-solutions for data exchange settings with target dependencies. PODS 2007: 113-122 - [i7]Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized Computations on Large Data Sets: Tight Lower Bounds. CoRR abs/cs/0703081 (2007) - 2006
- [j7]Nicole Schweikardt:
On the expressive power of monadic least fixed point logic. Theor. Comput. Sci. 350(2-3): 325-344 (2006) - [c16]Anuj Dawar
Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420 - [c15]Martin Grohe
Randomized computations on large data sets: tight lower bounds. PODS 2006: 243-252 - [i6]André Hernich, Nicole Schweikardt:
Reversal Complexity Revisited. CoRR abs/cs/0608036 (2006) - 2005
- [j6]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. J. Comput. Syst. Sci. 70(2): 101-127 (2005) - [j5]Martin Grohe
The succinctness of first-order logic on linear orders. Log. Methods Comput. Sci. 1(1) (2005) - [j4]Nicole Schweikardt:
Arithmetic, first-order logic, and counting quantifiers. ACM Trans. Comput. Log. 6(3): 634-671 (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
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
- [j3]Stephan Kreutzer, Nicole Schweikardt:
Logik und Informatik. it Inf. Technol. 46(3): 162-166 (2004) - [j2]Martin Grohe
Comparing the succinctness of monadic query languages over finite trees. RAIRO Theor. Informatics Appl. 38(4): 343-373 (2004) - [c10]Nicole Schweikardt:
On the Expressive Power of Monadic Least Fixed Point Logic. ICALP 2004: 1123-1135 - [c9]Martin Grohe, Nicole Schweikardt:
The Succinctness of First-Order Logic on Linear Orders. LICS 2004: 438-447 - [c8]Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier:
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams. VLDB 2004: 228-239 - [c7]Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier:
FluXQuery: An Optimizing XQuery Processor for Streaming XML Data. VLDB 2004: 1309-1312 - [i3]Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier:
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams. CoRR cs.DB/0406016 (2004) - 2003
- [c6]Martin Grohe, Nicole Schweikardt:
Comparing the Succinctness of Monadic Query Languages over Finite Trees. CSL 2003: 226-240 - 2002
- [j1]Oliver Matz, Nicole Schweikardt, Wolfgang Thomas:
The Monadic Quantifier Alternation Hierarchy over Grids and Graphs. Inf. Comput. 179(2): 356-383 (2002) - [p1]Nicole Schweikardt:
Die Ausdrucksstärke der Logik erster Stufe mit eingebauten Prädikaten. Ausgezeichnete Informatikdissertationen 2002: 153-162 - [i2]Nicole Schweikardt:
Arithmetic, First-Order Logic, and Counting Quantifiers. CoRR cs.LO/0211022 (2002) - [i1]Nicole Schweikardt:
An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory. CoRR cs.LO/0212049 (2002) - 2001
- [b1]Nicole Schweikardt:
On the expressive power of first-order logic with built-in predicates. Universität Mainz 2001, ISBN 978-3-8325-0017-7, pp. I-XI, 1-224 - [c5]Nicole Schweikardt:
The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered Group. CSL 2001: 130-144 - [c4]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
The Crane Beach Conjecture. LICS 2001: 187-196 - [c3]Clemens Lautemann, Nicole Schweikardt:
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. STACS 2001: 455-466
1990 – 1999
- 1999
- [c2]Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick:
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152 - 1997
- [c1]Nicole Schweikardt:
The Monadic Quantifier Alternation Hierarchy over Grids and Pictures. CSL 1997: 441-460
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-11-27 20:30 CET 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: