maximal matching in bounded-deletion streams
Published Streamed 2 months ago • 21 plays • Length 38:13Download video MP4
Download video MP3
Similar videos
-
40:23
maximum matching in $o(\log \log n)$ passes in dynamic streams
-
21:02
an asymptotically optimal algorithm for maximum matching in dynamic streams
-
30:40
toward optimal semi-streaming algorithm for (1 ε)-approximate maximum matching
-
1:00:37
recent progress on sublinear time algorithms for maximum matching: upper bounds
-
46:40
recent progress on sublinear time algorithms for maximum matching: lower bounds
-
49:29
higher order mds codes
-
33:54
streaming algorithms for connectivity augmentation
-
59:47
streaming euclidean k-median and k-means with o(log n) space
-
46:56
small space differentially private graph algorithms in the continual release model
-
31:37
sparsification for communication-efficient distributed symmetry-breaking
-
45:02
improved streaming algorithms for max-dicut via local snapshots
-
43:52
improved bounds for fully dynamic matching via ordered ruzsa-szemeredi graphs
-
33:30
o(log log n) passes is optimal for semi-streaming maximal independent set
-
31:31
streaming algorithms for matchings in low arboricity graphs
-
1:01:26
dynamic matching and (ordered) ruzsa-szemerédi graphs: towards constructive matching sparsifiers
-
21:59
sensitivity analysis of the maximum matching problem
-
49:28
dynamic matching: rounding & sparsification (and new tools)
-
30:08
streaming lower bounds for approximating max-cut
-
25:42
truly tight-in-$\delta$ bounds for bipartite maximal matching and variants
-
19:24
deterministic dynamic matching in worst-case update time
-
20:09
counting and sampling perfect matchings in regular expanding non-bipartite graphs
-
29:31
parallelization by approximation