default search action
Sandra Kiefer
Person information
- affiliation: University of Oxford, Department of Computer Science, Oxford, UK
- affiliation: Max Planck Institute for Software Systems (MPI-SWS), Saarbrücken, Germany
- affiliation: University of Warsaw, Poland
- affiliation (PhD 2020): RWTH Aachen University, Aachen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Sandra Kiefer
:
Polyregular Functions: Characterisations and Refutations. DLT 2024: 13-21 - [c14]Steffen van Bergerem
Verification of Population Protocols with Unordered Data. ICALP 2024: 156:1-156:20 - [c13]Sandra Kiefer
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. LICS 2024: 50:1-50:14 - [i17]Sandra Kiefer
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR abs/2402.03274 (2024) - [i16]Eva Fluck, Sandra Kiefer
Untangling Gaussian Mixtures. CoRR abs/2403.06671 (2024) - [i15]Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy:
Verification of Population Protocols with Unordered Data. CoRR abs/2405.00921 (2024) - [i14]Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel:
Detecting and explaining (in)equivalence of context-free grammars. CoRR abs/2407.18220 (2024) - 2023
- [c12]Steffen van Bergerem
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. LICS 2023: 1-13 - [i13]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 abs/2301.09234 (2023) - [i12]Steffen van Bergerem, Martin Grohe, Sandra Kiefer
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. CoRR abs/2304.12948 (2023) - 2022
- [j6]Sandra Kiefer
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. 36(1): 252-298 (2022) - [j5]Sandra Alves, Sandra Kiefer, Ana Sokolova:
Report on women in logic 2020 & 2021. ACM SIGLOG News 9(2): 31-33 (2022) - [j4]Sandra Kiefer
Graphs Identified by Logics with Counting. ACM Trans. Comput. Log. 23(1): 1:1-1:31 (2022) - [c11]Sandra Kiefer
A Study of Weisfeiler-Leman Colorings on Planar Graphs. ICALP 2022: 81:1-81:20 - [c10]Christopher Morris, Gaurav Rattan
SpeqNets: Sparsity-aware permutation-equivariant graph networks. ICML 2022: 16017-16042 - [c9]Jan Dreier
Treelike Decompositions for Transductions of Sparse Graphs. LICS 2022: 31:1-31:14 - [i11]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i10]Christopher Morris, Gaurav Rattan, Sandra Kiefer
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks. CoRR abs/2203.13913 (2022) - [i9]Sandra Kiefer
A Study of Weisfeiler-Leman Colorings on Planar Graphs. CoRR abs/2206.10557 (2022) - 2021
- [c8]Martin Grohe, Sandra Kiefer
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. ICALP 2021: 134:1-134:20 - [i8]Martin Grohe, Sandra Kiefer:
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs. CoRR abs/2106.16218 (2021) - 2020
- [b1]Sandra Kiefer:
Power and Limits of the Weisfeiler-Leman Algorithm. RWTH Aachen University, 2020, pp. i-viii, 1-249 - [j3]Sandra Kiefer:
The Weisfeiler-Leman algorithm: an exploration of its power. ACM SIGLOG News 7(3): 5-27 (2020) - [c7]Sandra Kiefer
The Iteration Number of Colour Refinement. ICALP 2020: 73:1-73:19 - [i7]Sandra Kiefer, Brendan D. McKay:
The Iteration Number of Colour Refinement. CoRR abs/2005.10182 (2020)
2010 – 2019
- 2019
- [j2]Sandra Kiefer
The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3. J. ACM 66(6): 44:1-44:31 (2019) - [j1]Sandra Kiefer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic. Log. Methods Comput. Sci. 15(2) (2019) - [c6]Mikolaj Bojanczyk, Sandra Kiefer
String-to-String Interpretations With Polynomial-Size Output. ICALP 2019: 106:1-106:14 - [c5]Martin Grohe, Sandra Kiefer
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. ICALP 2019: 117:1-117:15 - [c4]Sandra Kiefer
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. MFCS 2019: 45:1-45:15 - [i6]Martin Grohe, Sandra Kiefer:
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus. CoRR abs/1904.07216 (2019) - [i5]Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote:
String-to-String Interpretations with Polynomial-Size Output. CoRR abs/1905.13190 (2019) - [i4]Sandra Kiefer, Daniel Neuen:
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. CoRR abs/1908.05268 (2019) - 2017
- [c3]Sandra Kiefer
The Weisfeiler-Leman dimension of planar graphs is at most 3. LICS 2017: 1-12 - [i3]Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer:
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3. CoRR abs/1708.07354 (2017) - 2016
- [c2]Sandra Kiefer
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. LICS 2016: 287-296 - [i2]Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. CoRR abs/1605.03480 (2016) - 2015
- [c1]Sandra Kiefer
Graphs Identified by Logics with Counting. MFCS (1) 2015: 319-330 - [i1]Sandra Kiefer, Pascal Schweitzer, Erkal Selman:
Graphs Identified by Logics with Counting. CoRR abs/1503.08792 (2015)
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-19 20:47 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: