Media Summary: IGAFIT ALGORITHMIC COLLOQUIUM 2 Thatchaphol Saranurak, Toyota Technological Institute at Chicago Maximilian Probst Gutenberg (ETH Zurich) November 19, 2020. IGAFIT Algorithmic Colloquium February 11, 2021 , Jason Li, Carnegie Mellon University We present a
An Almost Linear Time Deterministic Algorithm For Expander Decomposition - Detailed Analysis & Overview
IGAFIT ALGORITHMIC COLLOQUIUM 2 Thatchaphol Saranurak, Toyota Technological Institute at Chicago Maximilian Probst Gutenberg (ETH Zurich) November 19, 2020. IGAFIT Algorithmic Colloquium February 11, 2021 , Jason Li, Carnegie Mellon University We present a Computer Science/Discrete Mathematics Seminar II Topic: Using Speaker : Sushant Sachdeva Affiliation : University of Toronto Abstract : We give the first 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) Sublinear
Leonid Gurvits (City University of New York) I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019. Computing a shortest path from a source s to a destination t in an undirected unweighted graph is a basic algorithmic problem ... Thatchaphol Saranurak, Improved Distributed Expander Decomposition & Nearly Optimal Triangle Enum. Stability and Testability Topic: Non-amenable groups admitting no sofic approximation by Authors:Yi-Jun Chang; Thatchaphol Saranurak Affiliations: ETH Zurich; Toyota Technological Institute at Chicago ...
CMU Theory Lunch talk from September 9th, 2020 by Jason Li on
