Media Summary: Computer Science/Discrete Mathematics Seminar II Topic: I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019. Talk for Presbueger Award 2023 @ ICALP 2023.

Using Expanders For Fast Graph Algorithms Thatchaphol Saranurak - Detailed Analysis & Overview

Computer Science/Discrete Mathematics Seminar II Topic: I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019. Talk for Presbueger Award 2023 @ ICALP 2023. Title: All-pairs minimum cuts in nearly quadratic time: a tutorial Abstract: We recently showed an Thatchaphol Saranurak, Improved Distributed Expander Decomposition & Nearly Optimal Triangle Enum. Abstract: We introduce a notion for hierarchical

Avi Wigderson Institute for Advanced Study June 15, 2010 For more videos, visit

Photo Gallery

Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak
Using expanders for dynamic graph algorithms: a survey of tools by Thatchaphol Saranurak
Expander Decomposition and Pruning: Faster, Stronger, and Simpler.
Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications
Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications
Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
Lecture 1.1 (8 31 2021) Introduction, Definitions of expanders
A Simple Deterministic Algorithm for Edge Connectivity
Expander Pruning
The Lazy-Greedy Path to Efficient Amortised Dynamic Algorithms by Eva Rotenberg
Dynamic graph algorithms against an adaptive adversary via Congestion Balancing
TCS+ Talk: Thatchaphol Saranurak (University of Michigan)
View Detailed Profile
Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak

Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak

Computer Science/Discrete Mathematics Seminar II Topic:

Using expanders for dynamic graph algorithms: a survey of tools by Thatchaphol Saranurak

Using expanders for dynamic graph algorithms: a survey of tools by Thatchaphol Saranurak

STOC'22 Workshop Dynamic

Expander Decomposition and Pruning: Faster, Stronger, and Simpler.

Expander Decomposition and Pruning: Faster, Stronger, and Simpler.

I practiced this talk and recorded it. It was given at Weizmann Institute in Feb 2019.

Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications

Thatchaphol Saranurak - Tutorial (Part 1): Expander Decompositions and Applications

Thatchaphol Saranurak

Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications

Thatchaphol Saranurak - Tutorial (Part 2): Expander Decompositions and Applications

Thatchaphol Saranurak

Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)

Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)

Abstract:

Lecture 1.1 (8 31 2021) Introduction, Definitions of expanders

Lecture 1.1 (8 31 2021) Introduction, Definitions of expanders

A

A Simple Deterministic Algorithm for Edge Connectivity

A Simple Deterministic Algorithm for Edge Connectivity

Presented at SOSA21.

Expander Pruning

Expander Pruning

Talk for Presbueger Award 2023 @ ICALP 2023.

The Lazy-Greedy Path to Efficient Amortised Dynamic Algorithms by Eva Rotenberg

The Lazy-Greedy Path to Efficient Amortised Dynamic Algorithms by Eva Rotenberg

STOC'22 Workshop Dynamic

Dynamic graph algorithms against an adaptive adversary via Congestion Balancing

Dynamic graph algorithms against an adaptive adversary via Congestion Balancing

Joint work

TCS+ Talk: Thatchaphol Saranurak (University of Michigan)

TCS+ Talk: Thatchaphol Saranurak (University of Michigan)

Title: All-pairs minimum cuts in nearly quadratic time: a tutorial Abstract: We recently showed an

Thatchaphol Saranurak,  Improved Distributed Expander Decomposition & Nearly Optimal Triangle Enum.

Thatchaphol Saranurak, Improved Distributed Expander Decomposition & Nearly Optimal Triangle Enum.

Thatchaphol Saranurak, Improved Distributed Expander Decomposition & Nearly Optimal Triangle Enum.

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich

Abstract: We introduce a notion for hierarchical

PMSP - Expander graphs: Applications and combinatorial constructions I - Avi Wigderson

PMSP - Expander graphs: Applications and combinatorial constructions I - Avi Wigderson

Avi Wigderson Institute for Advanced Study June 15, 2010 For more videos, visit http://video.ias.edu.