-
1
Counting induced subgraphs: an algebraic approach to #W[1]-hardness
Published 2019“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
2
Two variable logic with ultimately periodic counting
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
3
Better bounds for online line chasing
Published 2019“…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
Conference item -
4
Improved strong spatial mixing for colorings on trees
Published 2019“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
5
Counting induced subgraphs: a topological approach to #W[1]-hardness
Published 2019“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
6
Equivalence of hidden Markov models with continuous observations
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
7
Probabilistic automata of bounded ambiguity
Published 2017“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
8
The difference λ-calculus: a language for difference categories
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
9
Design-by-contract for flexible multiparty session protocols
Published 2022“…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
Conference item -
10
Automatically discovering and learning new visual categories with ranking statistics
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
11
Complexity of repair checking and consistent query answering
Published 2016“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
12
Strategy synthesis for partially observable stochastic games with neural perception mechanisms
Published 2024“…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
Conference item -
13
Logic of local inference for contextuality in quantum physics and beyond
Published 2016“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
14
Bounding the escape time of a linear dynamical system over a compact semialgebraic set
Published 2022“… Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
Conference item -
15
Unfolding-based partial order reduction
Published 2015“…Schloss Dagstuhl - Leibniz-Zentrum fur Informatik…”
Journal article -
16
A dichotomy for homomorphism−closed queries on probabilistic graphs
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
17
Counting edge-injective homomorphisms and matchings on restricted graph classes
Published 2017“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
18
A universal Skolem set of positive lower density
Published 2022“…Schloss Dagstuhl – Leibniz-Zentrum für Informatik…”
Conference item -
19
The complexity of promise SAT on non-Boolean domains
Published 2020“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item -
20
Metastability of the Potts ferromagnet on random regular graphs
Published 2022“…Schloss Dagstuhl - Leibniz-Zentrum für Informatik…”
Conference item