( en | de | ru )

 

Disambiguation of "Kiefer, Sandra"

Author of the publication

copydeleteadd this publication to your clipboard
The Weisfeiler-Leman dimension of planar graphs is at most 3.

, , and . LICS, page 1-12. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicholas Kiefer

Michael Kiefer

Daniel Kiefer

Teresa Kiefer

Sascha Kiefer

 

Other publications of authors with the same name

The Iteration Number of Colour Refinement., and . ICALP, volume 168 of LIPIcs, page 73:1-73:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)String-to-String Interpretations With Polynomial-Size Output., , and . ICALP, volume 132 of LIPIcs, page 106:1-106:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Polyregular Functions Characterisations and Refutations - Characterisations and Refutations.. DLT, volume 14791 of Lecture Notes in Computer Science, page 13-21. Springer, (2024)SpeqNets: Sparsity-aware permutation-equivariant graph networks., , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 16017-16042. PMLR, (2022)Untangling Gaussian Mixtures., , and . CoRR, (2024)Simulating Logspace-Recursion with Logarithmic Quantifier Depth., , , and . LICS, page 1-13. IEEE, (2023)A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus., and . ICALP, volume 132 of LIPIcs, page 117:1-117:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs., , and . CoRR, (2023)Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic., and . LICS, page 287-296. ACM, (2016)Power and Limits of the Weisfeiler-Leman Algorithm. RWTH Aachen University, (2020)