17:58A1A.1 Almost-linear Time Weighted \ell_p-norm Solvers in Slightly Dense Graphs via Sparsification
Advanced
A 18-minute video from ICALP 2021: “A1A.1 Almost-linear Time Weighted \ell_p-norm Solvers in Slightly Dense Graphs via Sparsification”.
89 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
17:58Advanced
A 18-minute video from ICALP 2021: “A1A.1 Almost-linear Time Weighted \ell_p-norm Solvers in Slightly Dense Graphs via Sparsification”.
20:08Advanced
A 20-minute video from ICALP 2021: “A1A.2 Faster Algorithms for Rooted Connectivity in Directed Graphs”.
20:08Advanced
A 20-minute video from ICALP 2021: “A1A.2 Faster Algorithms for Rooted Connectivity in Directed Graphs”.
22:29Advanced
A 22-minute video from ICALP 2021: “A1A.3 Breaking O(nr) for Matroid Intersection”.
19:10Advanced
A 19-minute video from ICALP 2021: “A1A.4 Deterministic Maximum Flows in Simple Graphs”.
24:57Advanced
A 25-minute video from ICALP 2021: “A1A.5 Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity”.
24:57Advanced
A 25-minute video from ICALP 2021: “A1A.5 Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity”.
25:24Advanced
A 25-minute video from ICALP 2021: “A1A.6 The Structure of Minimum Vertex Cuts”.
23:39Advanced
A 24-minute video from ICALP 2021: “A1B.1 Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges”.
23:39Advanced
A 24-minute video from ICALP 2021: “A1B.1 Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges”.
18:57Advanced
A 19-minute video from ICALP 2021: “A1B.2 Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs”.
24:42Advanced
A 25-minute video from ICALP 2021: “A1B.3 On Greedily Packing Anchored Rectangles”.
19:22Advanced
A 19-minute video from ICALP 2021: “A1B.4 Haystack Hunting Hints and Locker Room Communication”.
24:40Advanced
A 25-minute video from ICALP 2021: “A1B.5 Maximum Matchings and Popularity”.
23:31Advanced
A 24-minute video from ICALP 2021: “A1B.6 A subexponential algorithm for ARRIVAL”.
21:01Advanced
A 21-minute video from ICALP 2021: “A1C. 3 Fine-Grained Hardness for Edit Distance to a Fixed Sequence”.
15:42Advanced
A 16-minute video from ICALP 2021: “A1C.1 Optimal Fine-grained Hardness of Approximation of Linear Equations”.
25:00Advanced
A 25-minute video from ICALP 2021: “A1C.2 Conditional Dichotomy of Boolean Ordered Promise CSPs”.
23:55Advanced
A 24-minute video from ICALP 2021: “A1C.4 Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem”.
24:51Advanced
A 25-minute video from ICALP 2021: “A1C.5 Direct Sum and Partitionability Testing over General Groups”.
23:01Advanced
A 23-minute video from ICALP 2021: “A1C.6 Coboundary and cosystolic expansion from strong symmetry”.
25:06Advanced
A 25-minute video from ICALP 2021: “A2A.1 4 vs 7 sparse undirected unweighted Diameter is SETH-hard at time $n^{4/3}$”.
23:54Advanced
A 24-minute video from ICALP 2021: “A2A.2 Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths”.
21:33Advanced
A 22-minute video from ICALP 2021: “A2A.3 Approximation Algorithms for Min-Distance Problems in DAGs”.
23:57Advanced
A 24-minute video from ICALP 2021: “A2A.4 Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths”.
22:08Advanced
A 22-minute video from ICALP 2021: “A2A.5 Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time”.
25:01Advanced
A 25-minute video from ICALP 2021: “A2A.6 Lower Bounds on Dynamic Programming for Maximum Weight Independent Set”.
24:41Advanced
A 25-minute video from ICALP 2021: “A2B.1 Quantum algorithms for matrix scaling and matrix balancing”.
22:16Advanced
A 22-minute video from ICALP 2021: “A2B.2 Quantum query complexity with matrix-vector products”.
22:04Advanced
A 22-minute video from ICALP 2021: “A2B.3 Quasi-polynomial time algorithms for free quantum games in bounded dimension”.
22:49Advanced
A 23-minute video from ICALP 2021: “A2B.4 Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms”.
13:37Advanced
A 14-minute video from ICALP 2021: “A2B.5 Quantum Logspace Algorithm for Powering Matrices with Bounded Norm”.
23:16Advanced
A 23-minute video from ICALP 2021: “A2C.1 Fast n-fold Boolean Convolution via Additive Combinatorics”.
21:11Advanced
A 21-minute video from ICALP 2021: “A2C.3 Parameterized Applications of Symbolic Differentiation of (Totally) Multilinear Polynomials”.
28:14Advanced
A 28-minute video from ICALP 2021: “A2C.4 Knapsack and Subset Sum with Small Items”.
24:56Advanced
A 25-minute video from ICALP 2021: “A2C.5 Decision problems for second-order holonomic recurrences”.