Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sepehr Assadi
Observed name:
Assadi, Sepehr
Institution:
University of Waterloo
Observed institutions:
Rutgers, The State University of New Jersey,
Google (United States),
Sharif University of Technology,
IBM (United States),
University of Waterloo,
Princeton University,
Rice University,
Columbia University,
University of Pennsylvania,
Texas A&M University
show all 10
ORCID:
0009-0006-8914-5995
Observed ORCIDs:
0009-0006-8914-5995,
0000-0001-6482-6053
OpenAlex ID:
A5060978295
On Estimating Maximum Matching Size in Graph Streams
2017
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
70
PDF
Fully dynamic maximal independent set with sublinear update time
2018
·
Sepehr Assadi
, Krzysztof Onak
, et al.
·
ACM SIGACT Symposium on Theory of Computing (STOC)
·
55
PDF
Sublinear algorithms for (Δ + 1) vertex coloring
2019
·
Sepehr Assadi
, Yu Chen
, et al.
·
Symposium on Discrete Algorithms
·
46
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
2019
·
Sepehr Assadi
, MohammadHossein Bateni
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
46
PDF
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
2019
·
Sepehr Assadi
, Xiaorui Sun
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
44
PDF
Randomized Composable Coresets for Matching and Vertex Cover
2017
·
Sepehr Assadi
, Sanjeev Khanna
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
42
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons.
2017
·
Arpit Agarwal
, Shivani Agarwal
, et al.
·
Conference on Learning Theory
·
40
Sublinear Algorithms for (Δ + 1) Vertex Coloring
2019
·
Sepehr Assadi
, Yu Chen
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
39
Tight bounds for single-pass streaming complexity of the set cover problem
2016
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
38
PDF
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets
2015
·
Sepehr Assadi
, Justin Hsu
, et al.
·
Proceedings of the AAAI Conference on Human Computation and Crowdsourcing
·
38
PDF
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
2018
·
Assadi, Sepehr
, Kapralov, Michael
, et al.
·
arXiv (Cornell University)
·
36
PDF
The Stochastic Matching Problem with (Very) Few Queries
2016
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM Conference on Economics and Computation (EC)
·
36
PDF
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
2015
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
31
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders
2019
·
Sepehr Assadi
, Sahil Singla
·
Annual Symposium on Foundations of Computer Science
·
27
Complexity of the Minimum Input Selection Problem for Structural Controllability
2015
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
IFAC-PapersOnLine
·
25
The Stochastic Matching Problem
2017
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM Conference on Economics and Computation (EC)
·
23
Towards a Unified Theory of Sparsification for Matching Problems
2019
·
Assadi, Sepehr
, Bernstein, Aaron
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
2021
·
Sepehr Assadi
, Thomas Kesselheim
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
21
PDF
Polynomial pass lower bounds for graph streaming algorithms
2019
·
Sepehr Assadi
, Yu Chen
, et al.
·
ACM SIGACT Symposium on Theory of Computing (STOC)
·
21
PDF
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
2018
·
Assadi, Sepehr
, Onak, Krzysztof
, et al.
·
arXiv (Cornell University)
·
21
PDF
Combinatorial Auctions Do Need Modest Interaction
2017
·
Sepehr Assadi
·
ACM Conference on Economics and Computation (EC)
·
21
PDF
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
2017
·
Sepehr Assadi
·
ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)
·
19
PDF
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
2020
·
Sepehr Assadi
, Gillat Kol
, et al.
·
Annual Symposium on Foundations of Computer Science
·
18
PDF
Simple Round Compression for Parallel Vertex Cover
2017
·
Assadi, Sepehr
·
arXiv (Cornell University)
·
18
PDF
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets
2015
·
Assadi, Sepehr
, Hsu, Justin
, et al.
·
arXiv (Cornell University)
·
18
PDF
Show more works
View as search
Works count:
145
Citation count:
1,235
H-index:
21
I10-index:
38
Year
Topic
Type
