Resultados de procura - Assadi, Sepehr

A Two-Pass Lower Bound for Semi-Streaming Maximum Matching por Assadi, Sepehr

Ligazón do recurso
Ligazón do recurso

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching por Assadi, Sepehr

Ligazón do recurso
Ligazón do recurso

Faster Vizing and Near-Vizing Edge Coloring Algorithms por Assadi, Sepehr

Ligazón do recurso
Ligazón do recurso

Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits por Assadi, Sepehr, Wang, Chen

Ligazón do recurso
Ligazón do recurso

When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time por Assadi, Sepehr, Solomon, Shay

Ligazón do recurso
Ligazón do recurso

Palette Sparsification Beyond $(Δ+1)$ Vertex Coloring por Alon, Noga, Assadi, Sepehr

Ligazón do recurso
Ligazón do recurso

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms por Assadi, Sepehr, Raz, Ran

Ligazón do recurso
Ligazón do recurso

Beating Two-Thirds For Random-Order Streaming Matching por Assadi, Sepehr, Behnezhad, Soheil

Ligazón do recurso
Ligazón do recurso

Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma por Assadi, Sepehr, N, Vishvajeet

Ligazón do recurso
Ligazón do recurso

Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach por Assadi, Sepehr, Solomon, Shay

Ligazón do recurso
Ligazón do recurso

Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions por Assadi, Sepehr, Wang, Chen

Ligazón do recurso
Ligazón do recurso

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams por Assadi, Sepehr, Shah, Vihan

Ligazón do recurso
Ligazón do recurso

Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting por Assadi, Sepehr, Nguyen, Hoai-An

Ligazón do recurso
Ligazón do recurso

Tight Bounds for Vertex Connectivity in Dynamic Streams por Assadi, Sepehr, Shah, Vihan

Ligazón do recurso
Ligazón do recurso

(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond por Assadi, Sepehr, Sundaresan, Janani

Ligazón do recurso
Ligazón do recurso

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits por Assadi, Sepehr, Wang, Chen

Ligazón do recurso
Ligazón do recurso

Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings por Assadi, Sepehr, Sundaresan, Janani

Ligazón do recurso
Ligazón do recurso

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification por Assadi, Sepehr, Yazdanyar, Helia

Ligazón do recurso
Ligazón do recurso

Distributed Triangle Detection is Hard in Few Rounds por Assadi, Sepehr, Sundaresan, Janani

Ligazón do recurso
Ligazón do recurso

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication por Assadi, Sepehr, Shah, Vihan

Ligazón do recurso
Ligazón do recurso