Sandra Kiefer

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 36

Top Topics

Quantifier Free

Directed Acyclic

Top Venues

ACM SIGLOG News

Publications

Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy
Verification of Population Protocols with Unordered Data. CoRR (2024)
Sandra Kiefer
Polyregular Functions Characterisations and Refutations - Characterisations and Refutations. DLT (2024)
Eva Fluck, Sandra Kiefer, Christoph Standke
Untangling Gaussian Mixtures. CoRR (2024)
Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel
Detecting and explaining (in)equivalence of context-free grammars. CoRR (2024)
Sandra Kiefer, Daniel Neuen
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR (2024)
Sandra Kiefer, Daniel Neuen
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. LICS (2024)
Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy
Verification of Population Protocols with Unordered Data. ICALP (2024)
Sandra Kiefer, Lê Thành Dung Nguyên, Cécilia Pradic
Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs. CoRR (2023)
Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. LICS (2023)
Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. CoRR (2023)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. 36 (1) (2022)
Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks. CoRR (2022)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. ACM Trans. Comput. Log. 23 (1) (2022)
Sandra Kiefer, Daniel Neuen
A Study of Weisfeiler-Leman Colorings on Planar Graphs. ICALP (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike decompositions for transductions of sparse graphs. CoRR (2022)
Sandra Alves, Sandra Kiefer, Ana Sokolova
Report on women in logic 2020 & 2021. ACM SIGLOG News 9 (2) (2022)
Sandra Kiefer, Daniel Neuen
A Study of Weisfeiler-Leman Colorings on Planar Graphs. CoRR (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike Decompositions for Transductions of Sparse Graphs. LICS (2022)
Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh
SpeqNets: Sparsity-aware permutation-equivariant graph networks. ICML (2022)
Martin Grohe, Sandra Kiefer
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. ICALP (2021)
Martin Grohe, Sandra Kiefer
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. CoRR (2021)
Sandra Kiefer, Brendan D. McKay
The Iteration Number of Colour Refinement. ICALP (2020)
Sandra Kiefer
The Weisfeiler-Leman algorithm: an exploration of its power. ACM SIGLOG News 7 (3) (2020)
Sandra Kiefer, Brendan D. McKay
The Iteration Number of Colour Refinement. CoRR (2020)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66 (6) (2019)
Martin Grohe, Sandra Kiefer
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. CoRR (2019)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. Log. Methods Comput. Sci. 15 (2) (2019)
Martin Grohe, Sandra Kiefer
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. ICALP (2019)
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
String-to-String Interpretations with Polynomial-Size Output. CoRR (2019)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. CoRR (2019)
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
String-to-String Interpretations With Polynomial-Size Output. ICALP (2019)
Sandra Kiefer, Daniel Neuen
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. MFCS (2019)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3. CoRR (2017)
Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer
The Weisfeiler-Leman dimension of planar graphs is at most 3. LICS (2017)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. CoRR (2016)
Sandra Kiefer, Pascal Schweitzer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. LICS (2016)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. CoRR (2015)
Sandra Kiefer, Pascal Schweitzer, Erkal Selman
Graphs Identified by Logics with Counting. MFCS (1) (2015)