I agree that this site is using cookies. You can find further informations here.
X
Assadi, Sepehr
142  results:
Search for persons X
?
1

Optimal Multi-pass Lower Bounds for MST in Dynamic Streams:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun - p. 835-846 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

O(log log n) Passes Is Optimal for Semi-streaming Maximal I..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Assadi, Sepehr ; Konrad, Christian ; Naidu, Kheeran K.. - p. 847-858 , 2024
Link: https://dl.acm.org/doi/1..
 
?
3

Rounds vs. Communication Tradeoffs for Maximal Independent ..:

Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun
SIAM Journal on Computing.  , 2024
Link: https://doi.org/10.1137/..
 
?
4

On Regularity Lemma and Barriers in Streaming and Dynamic M..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Assadi, Sepehr ; Behnezhad, Soheil ; Khanna, Sanjeev. - p. 131-144 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

Hidden Permutations to the Rescue: Multi-Pass Streaming Low..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Assadi, Sepehr ; Sundaresan, Janani - p. 909-932 , 2023
Link: https://doi.org/10.1109/..
 
?
6

Fine-Grained Buy-Many Mechanisms Are Not Much Better Than B..:

, In: Proceedings of the 24th ACM Conference on Economics and Computation,
Assadi, Sepehr ; Kher, Vikram ; Li, George. - p. 123-152 , 2023
Link: https://dl.acm.org/doi/1..
 
?
7

Recent Advances in Multi-Pass Graph Streaming Lower Bounds:

Assadi, Sepehr
ACM SIGACT News.  54 (2023)  3 - p. 48-75 , 2023
Link: https://doi.org/10.1145/..
 
?
8

(Noisy) Gap Cycle Counting Strikes Back: Random Order Strea..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Assadi, Sepehr ; Sundaresan, Janani - p. 183-195 , 2023
Link: https://dl.acm.org/doi/1..
 
?
9

Improved Truthful Mechanisms for Combinatorial Auctions wit..:

Assadi, Sepehr ; Singla, Sahil
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
10

Coloring in Graph Streams via Deterministic and Adversarial..:

, In: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Assadi, Sepehr ; Chakrabarti, Amit ; Ghosh, Prantar. - p. 141-153 , 2023
Link: https://dl.acm.org/doi/1..
 
?
11

Rounds vs Communication Tradeoffs for Maximal Independent S..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Assadi, Sepehr ; Kol, Gillat ; Zhang, Zhijun - p. 1193-1204 , 2022
Link: https://doi.org/10.1109/..
 
?
12

Spine: Scaling up Programming-by-Negative-Example for Strin..:

, In: Proceedings of the 2022 International Conference on Management of Data,
Zuo, Chaoji ; Assadi, Sepehr ; Deng, Dong - p. 521-530 , 2022
Link: https://dl.acm.org/doi/1..
 
?
13

Introduction to the Special Issue on ACM-SIAM Symposium on ..:

Kamath, Gautam ; Assadi, Sepehr ; Driemel, Anne.
ACM Transactions on Algorithms.  18 (2022)  4 - p. 1-2 , 2022
Link: https://doi.org/10.1145/..
 
?
14

Deterministic graph coloring in the streaming model:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Assadi, Sepehr ; Chen, Andrew ; Sun, Glenn - p. 261-274 , 2022
Link: https://dl.acm.org/doi/1..
 
?
15

Brooks' theorem in graph streams: a single-pass semi-stream..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Assadi, Sepehr ; Kumar, Pankaj ; Mittal, Parth - p. 234-247 , 2022
Link: https://dl.acm.org/doi/1..
 
1-15