Nicole Schweikardt

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 49

Top Venues

Publications

Cristian Riveros, Markus L. Schmid, Nicole Schweikardt
A framework for extraction and transformation of documents. CoRR (2024)
Benjamin Scheidt, Nicole Schweikardt
Color Refinement for Relational Structures. CoRR (2024)
Cristian Riveros, Benjamin Scheidt, Nicole Schweikardt
Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas. CoRR (2024)
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)
Benjamin Scheidt, Nicole Schweikardt
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. MFCS (2023)
Benjamin Scheidt, Nicole Schweikardt
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. CoRR (2023)
Markus L. Schmid, Nicole Schweikardt
Document Spanners - A Brief Overview of Concepts, Results, and Recent Developments. PODS (2022)
Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt, Matthias Weidlich
Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints. ICDT (2022)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Alessio Conte, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Trans. Database Syst. 47 (3) (2022)
Markus L. Schmid, Nicole Schweikardt
Query Evaluation over SLP-Represented Document Databases with Complex Document Editing. PODS (2022)
Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM 69 (3) (2022)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. 18 (2) (2022)
Markus L. Schmid, Nicole Schweikardt
A Purely Regular Approach to Non-Regular Core Spanners. ICDT (2021)
Nicole Schweikardt
Locality Properties of Extensions of First-Order Logic and their Use in Algorithms (Abstract of Invited Talk). Description Logics (2021)
Steffen van Bergerem, Nicole Schweikardt
Learning Concepts Described By Weight Aggregation Logic. CSL (2021)
Markus L. Schmid, Nicole Schweikardt
Spanner Evaluation over SLP-Compressed Documents. CoRR (2021)
Markus L. Schmid, Nicole Schweikardt
Spanner Evaluation over SLP-Compressed Documents. PODS (2021)
Ulf Leser, Marcus Hilbrich, Claudia Draxl, Peter Eisert, Lars Grunske, Patrick Hostert, Dagmar Kainmüller, Odej Kao, Birte Kehr, Timo Kehrer, Christoph Koch, Volker Markl, Henning Meyerhenke, Tilmann Rabl, Alexander Reinefeld, Knut Reinert, Kerstin Ritter, Björn Scheuermann, Florian Schintke, Nicole Schweikardt, Matthias Weidlich
The Collaborative Research Center FONDA. Datenbank-Spektrum 21 (3) (2021)
Christoph Berkholz, Fabian Gerhardt, Nicole Schweikardt
Constant delay enumeration for conjunctive queries: a tutorial. ACM SIGLOG News 7 (1) (2020)
Christoph Berkholz, Nicole Schweikardt
Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width. CoRR (2020)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR (2020)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. PODS (2020)
Steffen van Bergerem, Nicole Schweikardt
Learning Concepts Described by Weight Aggregation Logic. CoRR (2020)
Markus L. Schmid, Nicole Schweikardt
A Purely Regular Approach to Non-Regular Core Spanners. CoRR (2020)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. CoRR (2019)
Nicole Schweikardt
Local normal forms and their use in algorithmic meta theorems (Invited Talk). LICS (2019)
Christoph Berkholz, Nicole Schweikardt
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. MFCS (2019)
Endre Boros, Benny Kimelfeld, Reinhard Pichler, Nicole Schweikardt
Enumeration in Data Management (Dagstuhl Seminar 19211). Dagstuhl Reports 9 (5) (2019)
Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
Enumeration for FO Queries over Nowhere Dense Graphs. PODS (2018)
Martin Grohe, Nicole Schweikardt
First-Order Query Evaluation with Cardinality Conditions. PODS (2018)
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
Finite-State Map-Reduce Computation and Relational Algebra Queries. ACM Trans. Comput. Log. 19 (2) (2018)
Maurizio Lenzerini, Wim Martens, Nicole Schweikardt
2018 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS (2018)
Jörg P. Bachmann, Johann-Christoph Freytag, Benjamin Hauskeller, Nicole Schweikardt
Measuring Congruence on High Dimensional Time Series. CoRR (2018)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering UCQs under Updates and in the Presence of Integrity Constraints. ICDT (2018)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD Queries under Updates on Bounded Degree Databases. ACM Trans. Database Syst. 43 (2) (2018)
Dietrich Kuske, Nicole Schweikardt
Gaifman Normal Forms for Counting Extensions of First-Order Logic. ICALP (2018)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering Conjunctive Queries under Updates. CoRR (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering UCQs under updates and in the presence of integrity constraints. CoRR (2017)
Martin Grohe, Nicole Schweikardt
First-Order Query Evaluation with Cardinality Conditions. CoRR (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering Conjunctive Queries under Updates. PODS (2017)
Dietrich Kuske, Nicole Schweikardt
First-order logic with counting. LICS (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD Queries Under Updates on Bounded Degree Databases. ICDT (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD queries under updates on bounded degree databases. CoRR (2017)
Dietrich Kuske, Nicole Schweikardt
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! CoRR (2017)
André Frochaux, Nicole Schweikardt
Monadic Datalog Containment on Trees Using the Descendant-Axis. AMW (2016)
Frederik Harwath, Nicole Schweikardt
On the locality of arb-invariant first-order formulas with modulo counting quantifiers. Log. Methods Comput. Sci. 12 (4) (2016)
Parvaneh Babari, Nicole Schweikardt
+\omega + ω -Picture Languages Recognizable by Büchi-Tiling Systems. LATA (2016)
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
Hanf normal form for first-order logic with unary counting quantifiers. LICS (2016)
André Frochaux, Nicole Schweikardt
Monadic Datalog Containment on Trees Using the Descendant-Axis. CoRR (2016)
Frederik Harwath, Lucas Heimberg, Nicole Schweikardt
Preservation and decomposition theorems for bounded degree structures. Log. Methods Comput. Sci. 11 (4) (2015)
Frank Neven, Nicole Schweikardt, Frédéric Servais, Tony Tan
Distributed Streaming with Finite Memory. ICDT (2015)
Nicole Schweikardt
Using Locality for Efficient Query Evaluation in Various Computation Models (Invited Talk). ICDT (2015)
André Frochaux, Martin Grohe, Nicole Schweikardt
Monadic Datalog Containment on Trees. CoRR (2014)
Frederik Harwath, Lucas Heimberg, Nicole Schweikardt
Preservation and decomposition theorems for bounded degree structures. CSL-LICS (2014)
Arnaud Durand, Nicole Schweikardt, Luc Segoufin
Enumerating answers to first-order queries over databases of low degree. PODS (2014)
André Frochaux, Martin Grohe, Nicole Schweikardt
Monadic Datalog Containment on Trees. AMW (2014)
Stephan Kreutzer, Nicole Schweikardt
On Hanf-equivalence and the number of embeddings of small induced subgraphs. CSL-LICS (2014)
Dominik D. Freydenberger, Nicole Schweikardt
Expressiveness and static analysis of extended conjunctive regular path queries. J. Comput. Syst. Sci. 79 (6) (2013)
Frederik Harwath, Nicole Schweikardt
On the locality of arb-invariant first-order logic with modulo counting quantifiers. CSL (2013)
Nicole Schweikardt
A Short Tutorial on Order-Invariant First-Order Logic. CSR (2013)
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. LICS (2013)
André Frochaux, Nicole Schweikardt
A note on monadic datalog on unranked trees. CoRR (2013)
Nicole Schweikardt
On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates. WoLLIC (2012)
Frederik Harwath, Nicole Schweikardt
Regular tree languages, cardinality predicates, and addition-invariant FO. STACS (2012)
Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
Locality from Circuit Lower Bounds. SIAM J. Comput. 41 (6) (2012)
Nicole Schweikardt
A Toolkit for Proving Limitations of the Expressive Power of Logics. MFCS (2012)
Dominik D. Freydenberger, Nicole Schweikardt
Expressiveness and Static Analysis of Extended Conjunctive Regular Path Queries. AMW (2011)
Nicole Schweikardt, Thomas Schwentick
A note on the expressive power of linear orders Log. Methods Comput. Sci. 7 (4) (2011)
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)
André Hernich, Leonid Libkin, Nicole Schweikardt
Closed world data exchange. ACM Trans. Database Syst. 36 (2) (2011)
Phokion G. Kolaitis, Maurizio Lenzerini, Nicole Schweikardt
Report on DEIS'10: advanced school on data exchange, information, and streams (A GI-Dagstuhl Seminar). SIGMOD Rec. 40 (1) (2011)
Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. 18 (2011)
Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick
Logik und Automaten: ein echtes Dreamteam. Inform. Spektrum 33 (5) (2010)
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)
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)
Nicole Schweikardt, Luc Segoufin
Addition-Invariant FO and Regularity. LICS (2010)
Martin Grohe, André Hernich, Nicole Schweikardt
Lower bounds for processing data with few random accesses to external memory. J. ACM 56 (3) (2009)
Nicole Schweikardt
Machine models for query processing. SIGMOD Rec. 38 (2) (2009)
Nicole Schweikardt
Lower Bounds for Multi-Pass Processing of Multiple Data Streams CoRR (2009)
Nicole Schweikardt
Lower Bounds for Multi-Pass Processing of Multiple Data Streams. STACS (2009)
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) (2009)
André Hernich, Nicole Schweikardt
Logic and Data Exchange: Which Solutions Are "Good" Solutions? LOFT (2008)
André Hernich, Nicole Schweikardt
Reversal complexity revisited. Theor. Comput. Sci. 401 (1-3) (2008)
Oliver Matz, Nicole Schweikardt
Expressive power of monadic logics on words, trees, pictures, and graphs. Logic and Automata (2008)
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
Model Theory Makes Formulas Large. ICALP (2007)
Martin Grohe, Christoph Koch, Nicole Schweikardt
Tight lower bounds for query processing on streaming and external memory data. Theor. Comput. Sci. 380 (1-2) (2007)
Nicole Schweikardt
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory. Inf. Comput. 205 (3) (2007)
Stephan Kreutzer, Martin Otto, Nicole Schweikardt
Boundedness of Monadic FO over Acyclic Structures. ICALP (2007)
Martin Grohe, André Hernich, Nicole Schweikardt
Randomized Computations on Large Data Sets: Tight Lower Bounds CoRR (2007)
Nicole Schweikardt
Machine models and lower bounds for query processing. PODS (2007)
André Hernich, Nicole Schweikardt
CWA-solutions for data exchange settings with target dependencies. PODS (2007)
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole Schweikardt, Jerzy Tyszkiewicz, Jan Van den Bussche
Database Query Processing Using Finite Cursor Machines. ICDT (2007)
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
Approximation Schemes for First-Order Definable Optimisation Problems. LICS (2006)
André Hernich, Nicole Schweikardt
Reversal Complexity Revisited CoRR (2006)
Martin Grohe, André Hernich, Nicole Schweikardt
Randomized computations on large data sets: tight lower bounds. PODS (2006)
Nicole Schweikardt
On the expressive power of monadic least fixed point logic. Theor. Comput. Sci. 350 (2-3) (2006)
Martin Grohe, Nicole Schweikardt
The succinctness of first-order logic on linear orders. Log. Methods Comput. Sci. 1 (1) (2005)
Martin Grohe, Christoph Koch, Nicole Schweikardt
Tight Lower Bounds for Query Processing on Streaming and External Memory Data. ICALP (2005)
Martin Grohe, Nicole Schweikardt
Lower bounds for sorting with few random accesses to external memory. PODS (2005)
Martin Grohe, Christoph Koch, Nicole Schweikardt
The Complexity of Querying External Memory and Streaming Data. FCT (2005)

Nicole Schweikardt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicole Schweikardt