Free Courses
    Back to courses

    Conference Talks

    49,909 courses
    ACCU Conference
    Aspen Institute
    Black Hat
    Collision Conference
    DefCamp
    DerbyCon
    Devoxx
    Ekoparty Security Conference
    Microsoft Ignite
    MLCon
    Oracle CloudWorld
    OSDI (Operating Systems Design and Implementation)
    PEPR (Privacy Engineering Practice and Respect)
    RSA Conference
    RubyConf
    Security BSides
    Security Onion
    TEDMED
    TEDx
    USENIX Enigma Conference
    USENIX Workshop on Free and Open Communications on the Internet (FOCI)
    VAULT (Linux Storage and Filesystems) Conference
    World Economic Forum
    Fully-Dynamic Submodular Cover with Bounded Recourse
    IEEE

    Fully-Dynamic Submodular Cover with Bounded Recourse

    Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
    IEEE

    Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier

    Edit Distance in Near-Linear Time - It’s a Constant Factor
    IEEE

    Edit Distance in Near-Linear Time - It’s a Constant Factor

    Near-Optimal Decremental SSSP in Dense Weighted Digraphs
    IEEE

    Near-Optimal Decremental SSSP in Dense Weighted Digraphs

    List Decodable Mean Estimation in Nearly Linear Time
    IEEE

    List Decodable Mean Estimation in Nearly Linear Time

    Nearly Optimal Pseudorandomness From Hardness
    IEEE

    Nearly Optimal Pseudorandomness From Hardness

    Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander
    IEEE

    Decodable Quantum LDPC Codes Beyond the Square Root Distance Barrier Using High Dimensional Expander

    Framework for Existential Real-Completeness of Two-Dimensional Packing Problems
    IEEE

    Framework for Existential Real-Completeness of Two-Dimensional Packing Problems

    Mechanisms for a No-Regret Agent - Beyond the Common Prior
    IEEE

    Mechanisms for a No-Regret Agent - Beyond the Common Prior

    Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures
    IEEE

    Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures

    Kernel Density Estimation through Density Constrained Near Neighbor Search
    IEEE

    Kernel Density Estimation through Density Constrained Near Neighbor Search

    Unit Capacity Maxflow in Almost m - 4/3 Time
    IEEE

    Unit Capacity Maxflow in Almost m - 4/3 Time

    Smoothing the Gap Between NP and ER
    IEEE

    Smoothing the Gap Between NP and ER

    A Dichotomy for Real Boolean Holant Problems
    IEEE

    A Dichotomy for Real Boolean Holant Problems

    Point Location and Active Learning - Learning Halfspaces Almost Optimally
    IEEE

    Point Location and Active Learning - Learning Halfspaces Almost Optimally

    Collaborative Top Distribution Identifications with Limited Interaction
    IEEE

    Collaborative Top Distribution Identifications with Limited Interaction

    Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
    IEEE

    Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity

    Cut-Equivalent Trees are Optimal for Min-Cut Queries
    IEEE

    Cut-Equivalent Trees are Optimal for Min-Cut Queries

    Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
    IEEE

    Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction

    AdWords in a Panorama
    IEEE

    AdWords in a Panorama

    Resolving the Optimal Metric Distortion Conjecture
    IEEE

    Resolving the Optimal Metric Distortion Conjecture