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

preview_player
Показать описание

  1. FODSI
Рекомендации по теме
Sepehr Assadi - 0:33:46

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

Sepehr Assadi - 1:42:09

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

A Simple (1−eps)-Approximation 0:46:49

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

An Asymptotically Optimal 0:21:02

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

TCS+ talk: Sepehr 1:05:39

TCS+ talk: Sepehr Assadi

Sepehr Assadi @ 0:58:34

Sepehr Assadi @ Theory Lunch

Graph Coloring Through 1:03:12

Graph Coloring Through the Sublinear Lens

Sublinear Time and 0:27:17

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

New Advances on 1:04:56

New Advances on Multi-Pass Graph Streaming Lower Bounds

Near-Quadratic Lower Bounds 0:25:29

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms

Sublinear Insights: A 0:33:41

Sublinear Insights: A Faster (Classical) Algorithm for Edge Coloring

ITCS 2022 Session 1:01:56

ITCS 2022 Session 11

STOC 2022 - 0:21:52

STOC 2022 - Deterministic Graph Coloring in the Streaming Model

STOC 2023 - 0:21:08

STOC 2023 - Session 1B - Random Order Streaming Lower Bounds for Connected Components and Beyond.

All-Norm Load Balancing 0:27:13

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

Improved Bounds for 0:20:53

Improved Bounds for Distributed Load Balancing

STOC 2022 - 0:25:13

STOC 2022 - Brooks’ Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for ∆-Coloring...

ITCS 2022 Session 1:08:34

ITCS 2022 Session 12

Multi-Pass Graph Streaming 0:21:01

Multi-Pass Graph Streaming LBs for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

Improved Truthful Mechanisms 0:22:44

Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders

STOC 2023 - 0:23:15

STOC 2023 - Session 1B - On Regularity Lemma and Barriers in Streaming and Dynamic Matching.

Sanjeev Khanna - 0:52:01

Sanjeev Khanna - Sublinear Algorithms for (Δ+1) Vertex Coloring

DIMACS Sublinear Workshop: 0:31:10

DIMACS Sublinear Workshop: Sanjeev Khanna - Approximate Matchings in Dynamic Graph Streams

IROS TV 2019- 0:06:39

IROS TV 2019- Rutgers University- Center for Accelerated Real Time Analytics