Network Coding Gaps for Completion Times of Multiple Unicasts
Offered By: IEEE via YouTube
Course Description
Overview
Explore network coding gaps for completion times of multiple unicasts in this 29-minute IEEE conference talk. Learn about the motivation, output model, and objectives behind this research. Understand protocols, completion-time gap examples, and the key questions addressed. Dive into the results, including warm-up bounds, cut bounds for routing and general scenarios, and the effectiveness of these bounds. Examine the moving cut proof and upper bounds on coding gaps. Discover high coding gap families and consider open questions in this field presented by researchers from Carnegie Mellon University.
Syllabus
Intro
Motivation
Model: Output
Model: Objective
What are Protocols?
Completion-Time Gap Example
Our Question
Our Results
Warm-up Bounds
Cut Bound I Only Valid for Routing
Cut Bound II
How Good are the Cut Bounds?
Moving Cut (Proof)
Upper Bounding the Coding Gap
High Coding Gap Families
Open Questions
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube