-
61
Counting triangles under updates in worst-case optimal time
Published 2019“…Schloss Dagstuhl…”
Conference item -
62
-
63
-
64
Supplementarity is necessary for quantum diagram reasoning
Published 2016“…Schloss Dagstuhl…”
Conference item -
65
-
66
A logarithmic approximation of linearly-ordered colourings
Published 2024“…Schloss Dagstuhl…”
Conference item -
67
-
68
A complete dichotomy for complex-valued Holant^c
Published 2018“…Schloss Dagstuhl…”
Conference item -
69
Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
Published 2023“…Schloss Dagstuhl…”
Conference item -
70
-
71
Characterizing definability in decidable fixpoint logics
Published 2017“…Schloss Dagstuhl…”
Conference item -
72
A complexity trichotomy for approximately counting list H-colourings
Published 2016“…Schloss Dagstuhl…”
Conference item -
73
-
74
-
75
-
76
-
77
Fractional coverings, greedy coverings, and rectifier networks
Published 2017“…Schloss Dagstuhl…”
Conference item -
78
-
79
-
80