Nicole Schweikardt

Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin: Locality from Circuit Lower Bounds. SIAM J. Comput. 41(6): 1481-1523 (2012)

Nicole Schweikardt: A Toolkit for Proving Limitations of the Expressive Power of Logics. MFCS 2012: 46-47

Frederik Harwath, Nicole Schweikardt: Regular tree languages, cardinality predicates, and addition-invariant FO. STACS 2012: 489-500

Nicole Schweikardt: On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates. WoLLIC 2012: 85-87

Nicole Schweikardt, Thomas Schwentick: A note on the expressive power of linear orders. Logical Methods in Computer Science 7(4) (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 Record 40(1): 40-42 (2011)

André Hernich, Leonid Libkin, Nicole Schweikardt: Closed world data exchange. ACM Trans. Database Syst. 36(2): 14 (2011)

Dominik D. Freydenberger, Nicole Schweikardt: Expressiveness and Static Analysis of Extended Conjunctive Regular Path Queries. AMW 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: 368-379

Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin: Locality from Circuit Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 18: 158 (2011)

Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick: Logik und Automaten: ein echtes Dreamteam. Informatik Spektrum 33(5): 452-461 (2010)

Nicole Schweikardt, Luc Segoufin: Addition-Invariant FO and Regularity. LICS 2010: 273-282

Martin Grohe, André Hernich, Nicole Schweikardt: Lower bounds for processing data with few random accesses to external memory. J. ACM 56(3) (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): 533-560 (2009)

Nicole Schweikardt: Machine models for query processing. SIGMOD Record 38(2): 18-28 (2009)

Nicole Schweikardt: Lower Bounds for Multi-Pass Processing of Multiple Data Streams. STACS 2009: 51-61

Nicole Schweikardt: Ehrenfeucht-Fraïssé Games. Encyclopedia of Database Systems 2009: 963-964

Nicole Schweikardt: One-Pass Algorithm. Encyclopedia of Database Systems 2009: 1948-1949

Nicole Schweikardt: Zero-One Laws. Encyclopedia of Database Systems 2009: 3683

Nicole Schweikardt: Lower Bounds for Multi-Pass Processing of Multiple Data Streams. CoRR abs/0902.1605 (2009)

André Hernich, Nicole Schweikardt: Reversal complexity revisited. Theor. Comput. Sci. 401(1-3): 191-205 (2008)

Oliver Matz, Nicole Schweikardt: Expressive power of monadic logics on words, trees, pictures, and graphs. Logic and Automata 2008: 531-552

André Hernich, Nicole Schweikardt: Logic and Data Exchange: Which Solutions Are "Good" Solutions? LOFT 2008: 61-85

Nicole Schweikardt: An Ehrenfeucht-Fraïssé game approach to collapse results in database theory. Inf. Comput. 205(3): 311-379 (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): 199-217 (2007)

Stephan Kreutzer, Martin Otto, Nicole Schweikardt: Boundedness of Monadic FO over Acyclic Structures. ICALP 2007: 571-582

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Model Theory Makes Formulas Large. ICALP 2007: 913-924

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

Nicole Schweikardt: Machine models and lower bounds for query processing. PODS 2007: 41-52

André Hernich, Nicole Schweikardt: CWA-solutions for data exchange settings with target dependencies. PODS 2007: 113-122

Martin Grohe, André Hernich, Nicole Schweikardt: Randomized Computations on Large Data Sets: Tight Lower Bounds. CoRR abs/cs/0703081 (2007)

Nicole Schweikardt: On the expressive power of monadic least fixed point logic. Theor. Comput. Sci. 350(2-3): 325-344 (2006)

Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: Approximation Schemes for First-Order Definable Optimisation Problems. LICS 2006: 411-420

Martin Grohe, André Hernich, Nicole Schweikardt: Randomized computations on large data sets: tight lower bounds. PODS 2006: 243-252

André Hernich, Nicole Schweikardt: Reversal Complexity Revisited. CoRR abs/cs/0608036 (2006)

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)

Martin Grohe, Nicole Schweikardt: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science 1(1) (2005)

Nicole Schweikardt: Arithmetic, first-order logic, and counting quantifiers. ACM Trans. Comput. Log. 6(3): 634-671 (2005)

Martin Grohe, Christoph Koch, Nicole Schweikardt: The Complexity of Querying External Memory and Streaming Data. FCT 2005: 1-16

Martin Grohe, Christoph Koch, Nicole Schweikardt: Tight Lower Bounds for Query Processing on Streaming and External Memory Data. ICALP 2005: 1076-1088

Martin Grohe, Stephan Kreutzer, Nicole Schweikardt: The Expressive Power of Two-Variable Least Fixed-Point Logics. MFCS 2005: 422-434

Martin Grohe, Nicole Schweikardt: Lower bounds for sorting with few random accesses to external memory. PODS 2005: 238-249

Martin Grohe, Nicole Schweikardt: The succinctness of first-order logic on linear orders. CoRR abs/cs/0502047 (2005)

Martin Grohe, Christoph Koch, Nicole Schweikardt: Tight Lower Bounds for Query Processing on Streaming and External Memory Data. CoRR abs/cs/0505002 (2005)

Stephan Kreutzer, Nicole Schweikardt: Logik und Informatik. it - Information Technology 46(3): 162-166 (2004)

Martin Grohe, Nicole Schweikardt: Comparing the succinctness of monadic query languages over finite trees. ITA 38(4): 343-373 (2004)

Nicole Schweikardt: On the Expressive Power of Monadic Least Fixed Point Logic. ICALP 2004: 1123-1135

Martin Grohe, Nicole Schweikardt: The Succinctness of First-Order Logic on Linear Orders. LICS 2004: 438-447

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

Christoph Koch, Stefanie Scherzinger, Nicole Schweikardt, Bernhard Stegmaier: FluXQuery: An Optimizing XQuery Processor for Streaming XML Data. VLDB 2004: 1309-1312

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)

Martin Grohe, Nicole Schweikardt: Comparing the Succinctness of Monadic Query Languages over Finite Trees. CSL 2003: 226-240

Oliver Matz, Nicole Schweikardt, Wolfgang Thomas: The Monadic Quantifier Alternation Hierarchy over Grids and Graphs. Inf. Comput. 179(2): 356-383 (2002)

Nicole Schweikardt: Arithmetic, First-Order Logic, and Counting Quantifiers. CoRR cs.LO/0211022 (2002)

Nicole Schweikardt: An Ehrenfeucht-Fraisse Game Approach to Collapse Results in Database Theory. CoRR cs.LO/0212049 (2002)

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

Nicole Schweikardt: The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered Group. CSL 2001: 130-144

David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien: The Crane Beach Conjecture. LICS 2001: 187-196

Clemens Lautemann, Nicole Schweikardt: An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. STACS 2001: 455-466

Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152

Nicole Schweikardt: The Monadic Quantifier Alternation Hierarchy over Grids and Pictures. CSL 1997: 441-460