YoVDO

IEEE FOCS: Foundations of Computer Science Courses

Faster Polytope Rounding, Sampling, and Volume Computation via a Sublinear Ball Walk
IEEE via YouTube
More Barriers for Rank Methods, via a "Numeric to Symbolic" Transfer
IEEE via YouTube
Noise Sensitivity on the p-Biased Hypercube
IEEE via YouTube
Breaking of 1RSB in Random MAX-NAE-SAT
IEEE via YouTube
Approximating Constraint Satisfaction Problems on High Dimensional Expanders
IEEE via YouTube
Sampling Graphs Without Forbidden Subgraphs and Unbalanced Expanders With Negligible Error
IEEE via YouTube
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank
IEEE via YouTube
Finding Monotone Patterns in Sublinear Time
IEEE via YouTube
Polylogarithmic Guarantees for Generalized Reordering Buffer Management
IEEE via YouTube
< Prev Page 15