A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “counting quantifiers” 4

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Counting Bounded Tree Depth Homomorphisms
2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe

21

citations
The Iteration Number of the Weisfeiler-Leman Algorithm
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research

Martin Grohe, Moritz Lichter, Daniel Neuen

6

citations
Simulating Logspace-Recursion with Logarithmic Quantifier Depth
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research

Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus

1

citations
Simulating Logspace-Recursion with Logarithmic Quantifier Depth
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus

0

citations

4 results