TCS+ talk: Sepehr Assadi

(1:5:39)

Sepehr Assadi - Tutorial: Ruzsa-Szemeredi Graphs and their Applications

(1:42:9)

Tutte Colloquium - Sepehr Assadi - 10/20/2023

(1:42)

Simple Sublinear Algorithms for Vertex Coloring

(13:40)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

(43:52)

Sepehr Assadi - Rutgers University - A (Slightly) Sublinear Space Streaming Algorithm for Matchings

(33:46)

Sepehr Assadi - Tight Bounds for Monotone Minimal Perfect Hashing

(54:42)

Sepehr Assadi @ Theory Lunch

(58:34)

A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching

(46:49)

Sepehr Assadi, Sublinear Algorithms for (Delta + 1) Vertex Coloring

(27:28)

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

(21:2)

New Advances on Multi-Pass Graph Streaming Lower Bounds

(1:4:56)

Sublinear Algorithms for (Delta + 1) Vertex Coloring

(42:1econd)

Graph Coloring Through the Sublinear Lens

(1:3:12)

Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions

(27:17)

On the Robust Communication Complexity of Bipartite Matching

(18:1econd)

EC'17: The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm

(18:54)

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method

(27:13)

O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set

(33:30)

Improved Bounds for Distributed Load Balancing

(20:53)