IEEE FOCS: Foundations of Computer Science Courses
IEEE via YouTube Derandomization from Algebraic Hardness - Treading the Borders
IEEE via YouTube Efficient Construction of Rigid Matrices Using an NP Oracle
IEEE via YouTube Hardness of Coding Problems
IEEE via YouTube Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers
IEEE via YouTube Planar Graphs Have Bounded Queue-Number
IEEE via YouTube Hardness Magnification for All Sparse NP Languages
IEEE via YouTube Leakage Resilient Secret Sharing Against Colluding Parties
IEEE via YouTube Non-Malleable Commitments Using Goldreich-Levin List Decoding
IEEE via YouTube A Deterministic Algorithm for Counting Colorings with 2Δ Colors
IEEE via YouTube