Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Kiefer, Sandra
131  Ergebnisse:
Personensuche X
?
1

Bounding the Weisfeiler-Leman Dimension via a Depth Analysi..:

, In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science,
Kiefer, Sandra ; Neuen, Daniel - p. 1-14 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Simulating Logspace-Recursion with Logarithmic Quantifier D..:

, In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
van Bergerem, Steffen ; Grohe, Martin ; Kiefer, Sandra. - p. 1-13 , 2023
Link: https://doi.org/10.1109/..
 
?
3

Report on women in logic 2020 & 2021:

Alves, Sandra ; Kiefer, Sandra ; Sokolova, Ana
ACM SIGLOG News.  9 (2022)  2 - p. 31-33 , 2022
Link: https://doi.org/10.1145/..
 
?
4

Treelike Decompositions for Transductions of Sparse Graphs:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
Dreier, Jan ; Gajarský, Jakub ; Kiefer, Sandra.. - p. 1-14 , 2022
Link: https://dl.acm.org/doi/1..
 
?
5

The Power of the Weisfeiler--Leman Algorithm to Decompose G..:

Kiefer, Sandra ; Neuen, Daniel
SIAM Journal on Discrete Mathematics.  36 (2022)  1 - p. 252-298 , 2022
Link: https://doi.org/10.1137/..
 
?
6

A training strategy for hybrid models to break the curse of..:

E. Samadi, Moein ; Kiefer, Sandra ; Fritsch, Sebastian Johaness...
PLOS ONE.  17 (2022)  9 - p. e0274569 , 2022
Link: https://doi.org/10.1371/..
 
?
7

Graphs Identified by Logics with Counting:

Kiefer, Sandra ; Schweitzer, Pascal ; Selman, Erkal
ACM Transactions on Computational Logic.  23 (2021)  1 - p. 1-31 , 2021
Link: https://doi.org/10.1145/..
 
?
8

Graphs Identified by Logics with Counting:

Kiefer, Sandra ; Schweitzer, Pascal ; Selman, Erkal
ACM Transactions on Computational Logic (TOCL).  23 (2021)  1 - p. 1-31 , 2021
Link: https://dl.acm.org/doi/1..
 
?
9

Power and limits of the Weisfeiler-Leman algorithm:

Kiefer, Sandra , 2020
Link: https://nbn-resolving.de..
 
?
10

The Weisfeiler-Leman algorithm : an exploration of its p..:

Kiefer, Sandra
ACM SIGLOG News.  7 (2020)  3 - p. 5-27 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

The Weisfeiler-Leman algorithm: an exploration of its power:

Kiefer, Sandra
ACM SIGLOG News.  7 (2020)  3 - p. 5-27 , 2020
Link: https://doi.org/10.1145/..
 
?
12

The Weisfeiler--Leman Dimension of Planar Graphs Is at Most..:

Kiefer, Sandra ; Ponomarenko, Ilia ; Schweitzer, Pascal
Journal of the ACM (JACM).  66 (2019)  6 - p. 1-31 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

The Weisfeiler--Leman Dimension of Planar Graphs Is at Most..:

Kiefer, Sandra ; Ponomarenko, Ilia ; Schweitzer, Pascal
Journal of the ACM.  66 (2019)  6 - p. 1-31 , 2019
Link: https://doi.org/10.1145/..
 
?
14

The weisfeiler-leman dimension of planar graphs is at most :

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Kiefer, Sandra ; Ponomarenko, Ilia ; Schweitzer, Pascal - p. 1-12 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Upper Bounds on the Quantifier Depth for Graph Differentiat..:

, In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science,
Kiefer, Sandra ; Schweitzer, Pascal - p. 287-296 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15