Sepehr Assadi

Available identifiers

zbMath Open assadi.sepehrMaRDI QIDQ487028

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126232	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6147289	2024-01-15	Paper
Ruling Sets in Random Order and Adversarial Streams	2023-12-08	Paper
Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring	2023-12-08	Paper
On the Robust Communication Complexity of Bipartite Matching	2023-11-20	Paper
Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma	2023-11-14	Paper
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020	2023-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q6084349	2023-10-31	Paper
Graph connectivity and single element recovery via linear and OR queries	2023-09-20	Paper
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.	2023-09-20	Paper
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time	2022-07-21	Paper
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling	2022-07-18	Paper
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions	2022-04-20	Paper
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem	2021-06-29	Paper
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets	2021-03-15	Paper
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs	2021-01-20	Paper
Separating the communication complexity of truthful and non-truthful combinatorial auctions	2021-01-19	Paper
Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits	2021-01-19	Paper
Polynomial pass lower bounds for graph streaming algorithms	2020-01-30	Paper
Stochastic Submodular Cover with Limited Adaptivity	2019-10-15	Paper
Sublinear Algorithms for (Δ + 1) Vertex Coloring	2019-10-15	Paper
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs	2019-10-15	Paper
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time	2019-10-15	Paper
Fully dynamic maximal independent set with sublinear update time	2019-08-22	Paper
On Estimating Maximum Matching Size in Graph Streams	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4608050	2018-03-15	Paper
Tight bounds for single-pass streaming complexity of the set cover problem	2017-09-29	Paper
On the rectangle escape problem	2017-09-07	Paper
Algorithms for Provisioning Queries and Analytics	2017-07-14	Paper
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches	2017-07-13	Paper
Fast Convergence in the Double Oral Auction	2016-01-08	Paper
The minimum vulnerability problem	2015-01-19	Paper
The Minimum Vulnerability Problem	2013-03-21	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sepehr Assadi