yannic maus: the role of randomness in local distributed graph problems
Published 4 years ago • 141 plays • Length 19:03Download video MP4
Download video MP3
Similar videos
-
54:35
distributed vertex coloring: classic meets modern (yannic maus)
-
3:04:36
adga 2020 — workshop on advances in distributed graph algorithms
-
17:41
efficient deterministic distributed coloring with small bandwidth
-
1:06:50
tcs talk: mohsen ghaffari
-
5:00
epe 401 genetic algorithm: graph coloring problem
-
6:17
constructive algorithms for graph colouring
-
28:40
edge colouring
-
22:28
distributed edge coloring in time quasi-polylogarithmic in delta
-
55:52
podc20 thursday graph algorithms and congest model
-
31:37
sparsification for communication-efficient distributed symmetry-breaking
-
1:14:02
anton bernshteyn: a fast distributed algorithm for (δ 1)-edge-coloring
-
24:32
distance-2 coloring in the congest model
-
1:01:56
itcs 2022 session 9
-
57:13
disc 2020 session 6
-
20:27
near optimal scheduling in the congested clique