59:24A New Look at Iterative Rounding (Part 1)
Advanced
A 59-minute video from CMU Theory: “A New Look at Iterative Rounding (Part 1)”.
1.52K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
59:24Advanced
A 59-minute video from CMU Theory: “A New Look at Iterative Rounding (Part 1)”.
52:28Advanced
A 52-minute video from CMU Theory: “A New Look at Iterative Rounding (Part 2)”.
57:54Advanced
A 58-minute video from CMU Theory: “Aaditya Ramdas on Exponential line-crossing inequalities”.
59:53Advanced
A 60-minute video from CMU Theory: “Aaditya Ramdas: Comparing sequential forecasters”.
59:39Advanced
A 60-minute video from CMU Theory: “Aditya Potukuchi on A spectral bound on Hypergraph discrepancy”.
1:01:47Advanced
A 62-minute video from CMU Theory: “Ainesh Bakshi on Sublinear Time Low-Rank Approximation of Distance Matrices”.
59:13Advanced
A 59-minute video from CMU Theory: “Ainesh Bakshi: Low-Rank Approximation with (1/ϵ)^1/3 Matrix-Vector Products”.
46:53Advanced
A 47-minute video from CMU Theory: “Akshayaram Srinivasan on Leakage-Resilient Secret Sharing”.
36:37Advanced
A 37-minute video from CMU Theory: “Alex Goldberg: Batching of Tasks by Users of Pseudonymous Forums”.
51:51Advanced
A 52-minute video from CMU Theory: “Alex Psomas "On Dynamic Mechanism Design"”.
50:01Advanced
A 50-minute video from CMU Theory: “Alex Psomas on "Controlled Dynamic Fair Division with Applications to Multiple Resources"”.
1:03:22Advanced
A 63-minute video from CMU Theory: “Alex Wang on Exactness in SDP relaxations of quadratically constrained quadratic programs”.
59:08Advanced
A 59-minute video from CMU Theory: “Alex Wang on Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues”.
1:09:23Advanced
A 69-minute video from CMU Theory: “Alex Wang: New notions of simultaneous diagonalizability of quadratic forms w/ applications to QCQPs”.
48:49Advanced
A 49-minute video from CMU Theory: “Alexandra Kolla on Matrix Signings, Ramanujan Graphs and Non-Expanding Independent Sets”.
47:46Advanced
A 48-minute video from CMU Theory: “Amey Bhangale on NP-hardness of Coloring 2-Colorable Hypergraph with Polylog Many Colors”.
55:35Advanced
A 56-minute video from CMU Theory: “Amir Shahrasbi on Synchronization Strings: Communication in the Presence of Insertions and Deletions”.
1:00:54Advanced
A 61-minute video from CMU Theory: “Amy Ward on "Dynamic Matching for Real-Time Ridesharing"”.
58:12Advanced
A 58-minute video from CMU Theory: “Andrea Lincoln on New Techniques for Proving Fine-Grained Average-Case Hardness”.
47:45Advanced
A 48-minute video from CMU Theory: “Angelos Pelecanos: On the t-wise Independence of Block Ciphers”.
1:01:33Advanced
A 62-minute video from CMU Theory: “Arvind Mahankali on Optimal L1 Column Subset Selection and a Faster PTAS for L1 Low-Rank Approx.”.
45:21Advanced
A 45-minute video from CMU Theory: “Ashwin Padaki: Sparse Navigable Graphs for Nearest Neighbor Search”.
45:28Advanced
A 45-minute video from CMU Theory: “Ben Berg on Towards Optimality in Parallel Job Scheduling”.
1:09:33Advanced
A 70-minute video from CMU Theory: “Bernardo Subercaseaux Roa: SAT-Solving for the Packing Chromatic Number of the Infinite Grid”.
49:18Advanced
A 49-minute video from CMU Theory: “Bernardo Subercaseaux: Breaking down graphs and hypergraphs into structured pieces”.
48:51Advanced
A 49-minute video from CMU Theory: “Bernardo Subercaseaux: Explaining Decision Trees is Harder Than You Would Think!”.
48:57Advanced
A 49-minute video from CMU Theory: “Bernardo Subercaseaux: The CNF Encoding Complexity of Boolean Functions”.
1:03:33Advanced
A 64-minute video from CMU Theory: “Bernhard Haeupler: Universally-Optimal Distributed Optimization”.
56:20Advanced
A 56-minute video from CMU Theory: “Brian Zhang: Fixed-Parameter Algorithms for Optimal Correlation in General-Sum Extensive-Form Games”.
42:42Advanced
A 43-minute video from CMU Theory: “C.J. Argue on Chasing Nested Convex Bodies”.
59:46Advanced
A 60-minute video from CMU Theory: “C.J. Argue on O(d)-competitive Convex Body Chasing”.
54:15Advanced
A 54-minute video from CMU Theory: “Changrui Mu: Public-Key Encryption from the MinRank Problem”.
58:26Advanced
A 58-minute video from CMU Theory: “Chirag Gupta: Faster online calibration without randomization”.
58:34Advanced
A 59-minute video from CMU Theory: “Chris Cox on Small Antipodal Spherical Codes”.
59:22Advanced
A 59-minute video from CMU Theory: “Colin White on "General and Robust Communication-Efficient Algorithms for Distributed Clustering"”.
52:12Advanced
A 52-minute video from CMU Theory: “Costin Bădescu on "Quantum State Certification"”.