BibSLEIGH — Nicole

Travelled to:

1 × Canada
1 × China
1 × Denmark
1 × France
1 × Italy
1 × Poland
1 × Portugal
1 × Switzerland
1 × United Kingdom
2 × Austria
2 × Finland
6 × USA

Collaborated with:

M.Grohe ∅ S.Kreutzer L.Segoufin F.Harwath A.Hernich C.Koch L.Heimberg A.Dawar S.Scherzinger B.Stegmaier A.Durand D.Kuske M.Otto M.Anderson D.v.Melkebeek D.A.M.Barrington N.Immerman C.Lautemann D.Thérien

Talks about:

order (8) queri (7) bound (6) first (5) data (5) structur (4) monad (4) lower (4) logic (4) stream (3)

Person: Nicole Schweikardt

DBLP: Schweikardt:Nicole

Contributed to:

2014

2013

2011

2010

2007

2006

2005

2004

2003

2001

1997

Wrote 23 papers:

LICS-CSL-2014-HarwathHS #bound #composition #theorem: Preservation and decomposition theorems for bounded degree structures (FH, LH, NS), p. 10.
LICS-CSL-2014-KreutzerS #on the: On Hanf-equivalence and the number of embeddings of small induced subgraphs (SK, NS), p. 10.
PODS-2014-DurandSS #database #first-order #query: Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.
CSL-2013-HarwathS #first-order #invariant #locality #logic #on the #quantifier: On the locality of arb-invariant first-order logic with modulo counting quantifiers (FH, NS), pp. 363–379.
LICS-2013-HeimbergKS #bound #normalisation: An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.
ICALP-v2-2011-AndersonMSS #first-order #invariant #locality #logic #query: Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
LICS-2010-SchweikardtS #invariant: Addition-Invariant FO and Regularity (NS, LS), pp. 273–282.
ICALP-2007-DawarGKS #scalability: Model Theory Makes Formulas Large (AD, MG, SK, NS), pp. 913–924.
ICALP-2007-KreutzerOS #bound #monad: Boundedness of Monadic FO over Acyclic Structures (SK, MO, NS), pp. 571–582.
PODS-2007-HernichS #dependence: CWA-solutions for data exchange settings with target dependencies (AH, NS), pp. 113–122.
PODS-2007-Schweikardt #bound #modelling #query: Machine models and lower bounds for query processing (NS), pp. 41–52.
LICS-2006-DawarGKS #approximate #first-order #optimisation #problem: Approximation Schemes for First-Order Definable Optimisation Problems (AD, MG, SK, NS), pp. 411–420.
PODS-2006-GroheHS #bound #random #scalability #set: Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
ICALP-2005-GroheKS #bound #memory management #query #streaming: Tight Lower Bounds for Query Processing on Streaming and External Memory Data (MG, CK, NS), pp. 1076–1088.
PODS-2005-GroheS #bound #memory management #random #sorting: Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.
ICALP-2004-Schweikardt #fixpoint #logic #monad #on the #power of: On the Expressive Power of Monadic Least Fixed Point Logic (NS), pp. 1123–1135.
LICS-2004-GroheS #first-order #linear #logic: The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
VLDB-2004-KochSSS #data type #query #scheduling: Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams (CK, SS, NS, BS), pp. 228–239.
VLDB-2004-KochSSS04a #named #optimisation #streaming #xml #xquery: FluXQuery: An Optimizing XQuery Processor for Streaming XML Data (CK, SS, NS, BS), pp. 1309–1312.
CSL-2003-GroheS #finite #monad #query: Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
CSL-2001-Schweikardt #database #order: The Natural Order-Generic Collapse for ω-Representable Databases over the Rational and the Real Ordered Group (NS), pp. 130–144.
LICS-2001-BarringtonILST: The Crane Beach Conjecture (DAMB, NI, CL, NS, DT), pp. 187–196.
CSL-1997-Schweikardt #monad #quantifier: The Monadic Quantifier Alternation Hierarchy over Grids and Pictures (NS), pp. 441–460.