Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Sepehr Assadi
@inproceedings{DBLP:conf/sosa/Assadi24,
author = {Sepehr Assadi},
editor = {Merav Parter and
Seth Pettie},
title = {A Simple {(1} - \emph{{\(\epsilon\)}})-Approximation Semi-Streaming
Algorithm for Maximum (Weighted) Matching},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {337--354},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.31},
doi = {10.1137/1.9781611977936.31},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/Assadi24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Assadi23,
author = {Sepehr Assadi},
title = {Recent Advances in Multi-Pass Graph Streaming Lower Bounds},
journal = {{SIGACT} News},
volume = {54},
number = {3},
pages = {48--75},
year = {2023},
url = {https://doi.org/10.1145/3623800.3623808},
doi = {10.1145/3623800.3623808},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Assadi23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/theoretics/AssadiKM23,
author = {Sepehr Assadi and
Pankaj Kumar and
Parth Mittal},
title = {Brooks' Theorem in Graph Streams: {A} Single-Pass Semi-Streaming Algorithm
for {\(\Delta\)}-Coloring},
journal = {TheoretiCS},
volume = {2},
year = {2023},
url = {https://doi.org/10.46298/theoretics.23.9},
doi = {10.46298/THEORETICS.23.9},
timestamp = {Wed, 06 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/theoretics/AssadiKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AssadiKY23,
author = {Sepehr Assadi and
Michael Kapralov and
Huacheng Yu},
editor = {Nicole Megow and
Adam D. Smith},
title = {On Constructing Spanners from Random Gaussian Projections},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {57:1--57:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.57},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.57},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/AssadiKY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AshvinkumarAD0023,
author = {Vikrant Ashvinkumar and
Sepehr Assadi and
Chengyuan Deng and
Jie Gao and
Chen Wang},
editor = {Nicole Megow and
Adam D. Smith},
title = {Evaluating Stability in Massive Social Networks: Efficient Streaming
Algorithms for Structural Balance},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {58:1--58:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.58},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.58},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AshvinkumarAD0023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiS23,
author = {Sepehr Assadi and
Janani Sundaresan},
title = {Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds
for Approximate Matchings},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {909--932},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00058},
doi = {10.1109/FOCS57990.2023.00058},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AssadiJPS23,
author = {Sepehr Assadi and
Nirmit Joshi and
Milind Prabhu and
Vihan Shah},
editor = {Floris Geerts and
Brecht Vandevoort},
title = {Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted
Inputs},
booktitle = {26th International Conference on Database Theory, {ICDT} 2023, March
28-31, 2023, Ioannina, Greece},
series = {LIPIcs},
volume = {255},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2023.19},
doi = {10.4230/LIPICS.ICDT.2023.19},
timestamp = {Fri, 17 Mar 2023 15:19:25 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AssadiJPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiBL23,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
editor = {Yael Tauman Kalai},
title = {All-Norm Load Balancing in Graph Streams via the Multiplicative Weights
Update Method},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {7:1--7:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.7},
doi = {10.4230/LIPICS.ITCS.2023.7},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AssadiBL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AssadiSW23,
author = {Sepehr Assadi and
Vihan Shah and
Chen Wang},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering
Cost},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/ee1a1ecc92f35702b5c29dad3dc909ea-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AssadiSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AssadiCGS23,
author = {Sepehr Assadi and
Amit Chakrabarti and
Prantar Ghosh and
Manuel Stoeckl},
editor = {Floris Geerts and
Hung Q. Ngo and
Stavros Sintos},
title = {Coloring in Graph Streams via Deterministic and Adversarially Robust
Algorithms},
booktitle = {Proceedings of the 42nd {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2023, Seattle, WA, USA, June 18-23, 2023},
pages = {141--153},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3584372.3588681},
doi = {10.1145/3584372.3588681},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/AssadiCGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKLS23,
author = {Sepehr Assadi and
Vikram Kher and
George Li and
Ariel Schvartzman},
editor = {Kevin Leyton{-}Brown and
Jason D. Hartline and
Larry Samuelson},
title = {Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling},
booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
{EC} 2023, London, United Kingdom, July 9-12, 2023},
pages = {123--152},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580507.3597662},
doi = {10.1145/3580507.3597662},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/AssadiKLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiFK23,
author = {Sepehr Assadi and
Martin Farach{-}Colton and
William Kuszmaul},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Tight Bounds for Monotone Minimal Perfect Hashing},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {456--476},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch20},
doi = {10.1137/1.9781611977554.CH20},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiFK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiS23,
author = {Sepehr Assadi and
Vihan Shah},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Tight Bounds for Vertex Connectivity in Dynamic Streams},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {213--227},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch20},
doi = {10.1137/1.9781611977585.CH20},
timestamp = {Mon, 20 Mar 2023 16:52:56 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiBKL23,
author = {Sepehr Assadi and
Soheil Behnezhad and
Sanjeev Khanna and
Huan Li},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On Regularity Lemma and Barriers in Streaming and Dynamic Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {131--144},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585110},
doi = {10.1145/3564246.3585110},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiBKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiS23,
author = {Sepehr Assadi and
Janani Sundaresan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower
Bounds for Connected Components and Beyond},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {183--195},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585192},
doi = {10.1145/3564246.3585192},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-07007,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
title = {All-Norm Load Balancing in Graph Streams via the Multiplicative Weights
Update Method},
journal = {CoRR},
volume = {abs/2301.07007},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.07007},
doi = {10.48550/ARXIV.2301.07007},
eprinttype = {arXiv},
eprint = {2301.07007},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-07007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-06288,
author = {Sepehr Assadi and
Nirmit Joshi and
Milind Prabhu and
Vihan Shah},
title = {Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted
Inputs},
journal = {CoRR},
volume = {abs/2303.06288},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.06288},
doi = {10.48550/ARXIV.2303.06288},
eprinttype = {arXiv},
eprint = {2303.06288},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-06288.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-11053,
author = {Sepehr Assadi and
Janani Sundaresan},
title = {(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower
Bounds for Connected Components and Beyond},
journal = {CoRR},
volume = {abs/2305.11053},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.11053},
doi = {10.48550/ARXIV.2305.11053},
eprinttype = {arXiv},
eprint = {2305.11053},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-11053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-00668,
author = {Vikrant Ashvinkumar and
Sepehr Assadi and
Chengyuan Deng and
Jie Gao and
Chen Wang},
title = {Evaluating Stability in Massive Social Networks: Efficient Streaming
Algorithms for Structural Balance},
journal = {CoRR},
volume = {abs/2306.00668},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.00668},
doi = {10.48550/ARXIV.2306.00668},
eprinttype = {arXiv},
eprint = {2306.00668},
timestamp = {Mon, 04 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-00668.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-02968,
author = {Sepehr Assadi},
title = {A Simple (1-{\(\epsilon\)})-Approximation Semi-Streaming Algorithm
for Maximum (Weighted) Matching},
journal = {CoRR},
volume = {abs/2307.02968},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.02968},
doi = {10.48550/ARXIV.2307.02968},
eprinttype = {arXiv},
eprint = {2307.02968},
timestamp = {Mon, 10 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-02968.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-03145,
author = {Sepehr Assadi and
Chen Wang},
title = {The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds
for Pure Exploration in Multi-armed Bandits},
journal = {CoRR},
volume = {abs/2309.03145},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.03145},
doi = {10.48550/ARXIV.2309.03145},
eprinttype = {arXiv},
eprint = {2309.03145},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-03145.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-05728,
author = {Sepehr Assadi and
Janani Sundaresan},
title = {Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower
Bounds for Approximate Matchings},
journal = {CoRR},
volume = {abs/2310.05728},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.05728},
doi = {10.48550/ARXIV.2310.05728},
eprinttype = {arXiv},
eprint = {2310.05728},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-05728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-04674,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Optimal Multi-Pass Lower Bounds for {MST} in Dynamic Streams},
journal = {CoRR},
volume = {abs/2312.04674},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.04674},
doi = {10.48550/ARXIV.2312.04674},
eprinttype = {arXiv},
eprint = {2312.04674},
timestamp = {Wed, 03 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-04674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-13178,
author = {Sepehr Assadi and
Christian Konrad and
Kheeran K. Naidu and
Janani Sundaresan},
title = {O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent
Set},
journal = {CoRR},
volume = {abs/2312.13178},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.13178},
doi = {10.48550/ARXIV.2312.13178},
eprinttype = {arXiv},
eprint = {2312.13178},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-13178.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AssadiK023,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Optimal Multi-Pass Lower Bounds for {MST} in Dynamic Streams},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-197}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/197},
eprinttype = {ECCC},
eprint = {TR23-197},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AssadiK023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AssadiKSW22,
author = {Sepehr Assadi and
Hrishikesh Khandeparkar and
Raghuvansh R. Saxena and
S. Matthew Weinberg},
title = {Separating the Communication Complexity of Truthful and Nontruthful
Algorithms for Combinatorial Auctions},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {20--75},
year = {2022},
url = {https://doi.org/10.1137/20m1370021},
doi = {10.1137/20M1370021},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AssadiKSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KamathADK22,
author = {Gautam Kamath and
Sepehr Assadi and
Anne Driemel and
Janardhan Kulkarni},
title = {Introduction to the Special Issue on {ACM-SIAM} Symposium on Discrete
Algorithms {(SODA)} 2020},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {4},
pages = {30:1--30:2},
year = {2022},
url = {https://doi.org/10.1145/3561912},
doi = {10.1145/3561912},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/KamathADK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AssadiN22,
author = {Sepehr Assadi and
Hoai{-}An Nguyen},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Asymptotically Optimal Bounds for Estimating H-Index in Sublinear
Time with Applications to Subgraph Counting},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {48:1--48:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.48},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.48},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AssadiN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/AssadiCLMW22,
author = {Sepehr Assadi and
Vaggos Chatziafratis and
Jakub Lacki and
Vahab Mirrokni and
Chen Wang},
editor = {Po{-}Ling Loh and
Maxim Raginsky},
title = {Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and
Space Lower Bounds},
booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}},
series = {Proceedings of Machine Learning Research},
volume = {178},
pages = {4643--4702},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v178/assadi22a.html},
timestamp = {Sun, 22 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/AssadiCLMW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiK022,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Rounds vs Communication Tradeoffs for Maximal Independent Sets},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1193--1204},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00115},
doi = {10.1109/FOCS54457.2022.00115},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AssadiBD22,
author = {Sepehr Assadi and
Aaron Bernstein and
Aditi Dudeja},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Decremental Matching in General Graphs},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.11},
doi = {10.4230/LIPICS.ICALP.2022.11},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AssadiBD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiS22,
author = {Sepehr Assadi and
Vihan Shah},
editor = {Mark Braverman},
title = {An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic
Streams},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {9:1--9:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.9},
doi = {10.4230/LIPICS.ITCS.2022.9},
timestamp = {Wed, 26 Jan 2022 14:33:51 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AssadiS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Assadi022,
author = {Sepehr Assadi and
Chen Wang},
editor = {Mark Braverman},
title = {Sublinear Time and Space Algorithms for Correlation Clustering via
Sparse-Dense Decompositions},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {10:1--10:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.10},
doi = {10.4230/LIPICS.ITCS.2022.10},
timestamp = {Wed, 26 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Assadi022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Assadi022,
author = {Sepehr Assadi and
Chen Wang},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration
with Instance-sensitive Sample Complexity},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/d5e9cf50dc182447a916bc56d4d42942-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/Assadi022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/ZuoAD22,
author = {Chaoji Zuo and
Sepehr Assadi and
Dong Deng},
editor = {Zachary G. Ives and
Angela Bonifati and
Amr El Abbadi},
title = {Spine: Scaling up Programming-by-Negative-Example for String Filtering
and Transformation},
booktitle = {{SIGMOD} '22: International Conference on Management of Data, Philadelphia,
PA, USA, June 12 - 17, 2022},
pages = {521--530},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3514221.3517908},
doi = {10.1145/3514221.3517908},
timestamp = {Thu, 16 Mar 2023 09:51:25 +0100},
biburl = {https://dblp.org/rec/conf/sigmod/ZuoAD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiJJST22,
author = {Sepehr Assadi and
Arun Jambulapati and
Yujia Jin and
Aaron Sidford and
Kevin Tian},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {627--669},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.29},
doi = {10.1137/1.9781611977073.29},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiJJST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Assadi22,
author = {Sepehr Assadi},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {708--742},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.32},
doi = {10.1137/1.9781611977073.32},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Assadi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKM22,
author = {Sepehr Assadi and
Pankaj Kumar and
Parth Mittal},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Brooks' theorem in graph streams: a single-pass semi-streaming algorithm
for {\unicode{8710}}-coloring},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {234--247},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520005},
doi = {10.1145/3519935.3520005},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiCS22,
author = {Sepehr Assadi and
Andrew Chen and
Glenn Sun},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic graph coloring in the streaming model},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {261--274},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520016},
doi = {10.1145/3519935.3520016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiCS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Assadi22,
author = {Sepehr Assadi},
editor = {Christian Scheideler},
title = {Graph Coloring, Palette Sparsification, and Beyond (Invited Talk)},
booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022,
October 25-27, 2022, Augusta, Georgia, {USA}},
series = {LIPIcs},
volume = {246},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.DISC.2022.1},
doi = {10.4230/LIPICS.DISC.2022.1},
timestamp = {Mon, 17 Oct 2022 16:44:53 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Assadi22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-12710,
author = {Sepehr Assadi and
Vihan Shah},
title = {An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic
Streams},
journal = {CoRR},
volume = {abs/2201.12710},
year = {2022},
url = {https://arxiv.org/abs/2201.12710},
eprinttype = {arXiv},
eprint = {2201.12710},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-12710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-10984,
author = {Sepehr Assadi and
Pankaj Kumar and
Parth Mittal},
title = {Brooks' Theorem in Graph Streams: {A} Single-Pass Semi-Streaming Algorithm
for {\(\Delta\)}-Coloring},
journal = {CoRR},
volume = {abs/2203.10984},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.10984},
doi = {10.48550/ARXIV.2203.10984},
eprinttype = {arXiv},
eprint = {2203.10984},
timestamp = {Tue, 29 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-10984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-14312,
author = {Sepehr Assadi and
Ariel Schvartzman},
title = {Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling},
journal = {CoRR},
volume = {abs/2205.14312},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2205.14312},
doi = {10.48550/ARXIV.2205.14312},
eprinttype = {arXiv},
eprint = {2205.14312},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2205-14312.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07554,
author = {Sepehr Assadi and
Vaggos Chatziafratis and
Jakub Lacki and
Vahab S. Mirrokni and
Chen Wang},
title = {Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and
Space Lower Bounds},
journal = {CoRR},
volume = {abs/2206.07554},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07554},
doi = {10.48550/ARXIV.2206.07554},
eprinttype = {arXiv},
eprint = {2206.07554},
timestamp = {Tue, 21 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07554.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-00927,
author = {Sepehr Assadi and
Aaron Bernstein and
Aditi Dudeja},
title = {Decremental Matching in General Graphs},
journal = {CoRR},
volume = {abs/2207.00927},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.00927},
doi = {10.48550/ARXIV.2207.00927},
eprinttype = {arXiv},
eprint = {2207.00927},
timestamp = {Wed, 06 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-00927.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-09354,
author = {Sepehr Assadi and
Soheil Behnezhad and
Sanjeev Khanna and
Huan Li},
title = {On Regularity Lemma and Barriers in Streaming and Dynamic Matching},
journal = {CoRR},
volume = {abs/2207.09354},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.09354},
doi = {10.48550/ARXIV.2207.09354},
eprinttype = {arXiv},
eprint = {2207.09354},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-09354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-10556,
author = {Sepehr Assadi and
Martin Farach{-}Colton and
William Kuszmaul},
title = {Tight Bounds for Monotone Minimal Perfect Hashing},
journal = {CoRR},
volume = {abs/2207.10556},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.10556},
doi = {10.48550/ARXIV.2207.10556},
eprinttype = {arXiv},
eprint = {2207.10556},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-10556.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-08114,
author = {Sepehr Assadi and
Hoai{-}An Nguyen},
title = {Asymptotically Optimal Bounds for Estimating H-Index in Sublinear
Time with Applications to Subgraph Counting},
journal = {CoRR},
volume = {abs/2209.08114},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.08114},
doi = {10.48550/ARXIV.2209.08114},
eprinttype = {arXiv},
eprint = {2209.08114},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-08114.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-09049,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Rounds vs Communication Tradeoffs for Maximal Independent Sets},
journal = {CoRR},
volume = {abs/2209.09049},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.09049},
doi = {10.48550/ARXIV.2209.09049},
eprinttype = {arXiv},
eprint = {2209.09049},
timestamp = {Tue, 11 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-09049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-14775,
author = {Sepehr Assadi and
Michael Kapralov and
Huacheng Yu},
title = {On Constructing Spanners from Random Gaussian Projections},
journal = {CoRR},
volume = {abs/2209.14775},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.14775},
doi = {10.48550/ARXIV.2209.14775},
eprinttype = {arXiv},
eprint = {2209.14775},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-14775.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04685,
author = {Sepehr Assadi and
Vihan Shah},
title = {Tight Bounds for Vertex Connectivity in Dynamic Streams},
journal = {CoRR},
volume = {abs/2211.04685},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04685},
doi = {10.48550/ARXIV.2211.04685},
eprinttype = {arXiv},
eprint = {2211.04685},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04685.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-10641,
author = {Sepehr Assadi and
Amit Chakrabarti and
Prantar Ghosh and
Manuel Stoeckl},
title = {Coloring in Graph Streams via Deterministic and Adversarially Robust
Algorithms},
journal = {CoRR},
volume = {abs/2212.10641},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.10641},
doi = {10.48550/ARXIV.2212.10641},
eprinttype = {arXiv},
eprint = {2212.10641},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-10641.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AssadiKZ22,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Rounds vs Communication Tradeoffs for Maximal Independent Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-136}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/136},
eprinttype = {ECCC},
eprint = {TR22-136},
timestamp = {Tue, 11 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AssadiKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AssadiKL21,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover
Problem},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1095482},
doi = {10.1137/16M1095482},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AssadiKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AssadiB21,
author = {Sepehr Assadi and
Soheil Behnezhad},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {On the Robust Communication Complexity of Bipartite Matching},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {48:1--48:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.48},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.48},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/AssadiB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AssadiCK21,
author = {Sepehr Assadi and
Deeparnab Chakrabarty and
Sanjeev Khanna},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Graph Connectivity and Single Element Recovery via Linear and {OR}
Queries},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {7:1--7:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.7},
doi = {10.4230/LIPICS.ESA.2021.7},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/AssadiCK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AssadiS21,
author = {Sepehr Assadi and
Shay Solomon},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal
Approximation Through a Local Approach},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.8},
doi = {10.4230/LIPICS.ESA.2021.8},
timestamp = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AssadiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AssadiB21,
author = {Sepehr Assadi and
Soheil Behnezhad},
editor = {Nikhil Bansal and
Emanuela Merelli and
James Worrell},
title = {Beating Two-Thirds For Random-Order Streaming Matching},
booktitle = {48th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},
series = {LIPIcs},
volume = {198},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.19},
doi = {10.4230/LIPICS.ICALP.2021.19},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AssadiB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKS21,
author = {Sepehr Assadi and
Thomas Kesselheim and
Sahil Singla},
editor = {D{\'{a}}niel Marx},
title = {Improved Truthful Mechanisms for Subadditive Combinatorial Auctions:
Breaking the Logarithmic Barrier},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {653--661},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.40},
doi = {10.1137/1.9781611976465.40},
timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiLT21,
author = {Sepehr Assadi and
S. Cliff Liu and
Robert E. Tarjan},
editor = {Hung Viet Le and
Valerie King},
title = {An Auction Algorithm for Bipartite Matching in Streaming and Massively
Parallel Computation Models},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {165--171},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.18},
doi = {10.1137/1.9781611976496.18},
timestamp = {Wed, 17 Mar 2021 13:30:03 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiLT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AssadiD21,
author = {Sepehr Assadi and
Aditi Dudeja},
editor = {Hung Viet Le and
Valerie King},
title = {A Simple Semi-Streaming Algorithm for Global Minimum Cuts},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {172--180},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.19},
doi = {10.1137/1.9781611976496.19},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/AssadiD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiN21,
author = {Sepehr Assadi and
Vishvajeet N},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Graph streaming lower bounds for parameter estimation and property
testing via a streaming {XOR} lemma},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {612--625},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451110},
doi = {10.1145/3406325.3451110},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AssadiD21,
author = {Sepehr Assadi and
Aditi Dudeja},
editor = {Seth Gilbert},
title = {Ruling Sets in Random Order and Adversarial Streams},
booktitle = {35th International Symposium on Distributed Computing, {DISC} 2021,
October 4-8, 2021, Freiburg, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {209},
pages = {6:1--6:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.DISC.2021.6},
doi = {10.4230/LIPICS.DISC.2021.6},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AssadiD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07011,
author = {Sepehr Assadi and
Soheil Behnezhad},
title = {Beating Two-Thirds For Random-Order Streaming Matching},
journal = {CoRR},
volume = {abs/2102.07011},
year = {2021},
url = {https://arxiv.org/abs/2102.07011},
eprinttype = {arXiv},
eprint = {2102.07011},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-04908,
author = {Sepehr Assadi and
Vishvajeet N},
title = {Graph Streaming Lower Bounds for Parameter Estimation and Property
Testing via a Streaming {XOR} Lemma},
journal = {CoRR},
volume = {abs/2104.04908},
year = {2021},
url = {https://arxiv.org/abs/2104.04908},
eprinttype = {arXiv},
eprint = {2104.04908},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-04908.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-06889,
author = {Sepehr Assadi and
Shay Solomon},
title = {Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal
Approximation Through a Local Approach},
journal = {CoRR},
volume = {abs/2105.06889},
year = {2021},
url = {https://arxiv.org/abs/2105.06889},
eprinttype = {arXiv},
eprint = {2105.06889},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-06889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-07187,
author = {Sepehr Assadi},
title = {A Two-Pass Lower Bound for Semi-Streaming Maximum Matching},
journal = {CoRR},
volume = {abs/2108.07187},
year = {2021},
url = {https://arxiv.org/abs/2108.07187},
eprinttype = {arXiv},
eprint = {2108.07187},
timestamp = {Fri, 20 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-07187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-14528,
author = {Sepehr Assadi and
Chen Wang},
title = {Sublinear Time and Space Algorithms for Correlation Clustering via
Sparse-Dense Decompositions},
journal = {CoRR},
volume = {abs/2109.14528},
year = {2021},
url = {https://arxiv.org/abs/2109.14528},
eprinttype = {arXiv},
eprint = {2109.14528},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-14528.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-14891,
author = {Sepehr Assadi and
Andrew Chen and
Glenn Sun},
title = {Deterministic Graph Coloring in the Streaming Model},
journal = {CoRR},
volume = {abs/2109.14891},
year = {2021},
url = {https://arxiv.org/abs/2109.14891},
eprinttype = {arXiv},
eprint = {2109.14891},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-14891.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/AssadiS20,
author = {Sepehr Assadi and
Sahil Singla},
title = {Improved truthful mechanisms for combinatorial auctions with submodular
bidders},
journal = {SIGecom Exch.},
volume = {18},
number = {1},
pages = {19--27},
year = {2020},
url = {https://doi.org/10.1145/3440959.3440964},
doi = {10.1145/3440959.3440964},
timestamp = {Mon, 04 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigecom/AssadiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/Assadi20,
author = {Sepehr Assadi},
title = {Combinatorial Auctions Do Need Modest Interaction},
journal = {{ACM} Trans. Economics and Comput.},
volume = {8},
number = {1},
pages = {3:1--3:23},
year = {2020},
url = {https://doi.org/10.1145/3381521},
doi = {10.1145/3381521},
timestamp = {Thu, 30 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/Assadi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AlonA20,
author = {Noga Alon and
Sepehr Assadi},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Palette Sparsification Beyond ({\(\Delta\)}+1) Vertex Coloring},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {6:1--6:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.6},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AlonA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiR20,
author = {Sepehr Assadi and
Ran Raz},
editor = {Sandy Irani},
title = {Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {342--353},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00040},
doi = {10.1109/FOCS46700.2020.00040},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AssadiR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiKSY20,
author = {Sepehr Assadi and
Gillat Kol and
Raghuvansh R. Saxena and
Huacheng Yu},
editor = {Sandy Irani},
title = {Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT,
Matching Size, and Other Problems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {354--364},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00041},
doi = {10.1109/FOCS46700.2020.00041},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiKSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AssadiKO20,
author = {Sepehr Assadi and
Gillat Kol and
Rotem Oshman},
editor = {Yuval Emek and
Christian Cachin},
title = {Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal
Independent Sets},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {79--88},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405732},
doi = {10.1145/3382734.3405732},
timestamp = {Tue, 04 Aug 2020 16:04:51 +0200},
biburl = {https://dblp.org/rec/conf/podc/AssadiKO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKSW20,
author = {Sepehr Assadi and
Hrishikesh Khandeparkar and
Raghuvansh R. Saxena and
S. Matthew Weinberg},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Separating the communication complexity of truthful and non-truthful
combinatorial auctions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1073--1085},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384267},
doi = {10.1145/3357713.3384267},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiW20,
author = {Sepehr Assadi and
Chen Wang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Exploration with limited memory: streaming algorithms for coin tossing,
noisy comparisons, and multi-armed bandits},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1237--1250},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384341},
doi = {10.1145/3357713.3384341},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AssadiBL20,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
editor = {Hagit Attiya},
title = {Improved Bounds for Distributed Load Balancing},
booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020,
October 12-16, 2020, Virtual Conference},
series = {LIPIcs},
volume = {179},
pages = {1:1--1:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.DISC.2020.1},
doi = {10.4230/LIPICS.DISC.2020.1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AssadiBL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-04666,
author = {Sepehr Assadi and
Chen Wang},
title = {Exploration with Limited Memory: Streaming Algorithms for Coin Tossing,
Noisy Comparisons, and Multi-Armed Bandits},
journal = {CoRR},
volume = {abs/2004.04666},
year = {2020},
url = {https://arxiv.org/abs/2004.04666},
eprinttype = {arXiv},
eprint = {2004.04666},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-04666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-07628,
author = {Sepehr Assadi and
Shay Solomon},
title = {When Algorithms for Maximal Independent Set and Maximal Matching Run
in Sublinear-Time},
journal = {CoRR},
volume = {abs/2006.07628},
year = {2020},
url = {https://arxiv.org/abs/2006.07628},
eprinttype = {arXiv},
eprint = {2006.07628},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-07628.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-10456,
author = {Noga Alon and
Sepehr Assadi},
title = {Palette Sparsification Beyond ({\(\Delta\)}+1) Vertex Coloring},
journal = {CoRR},
volume = {abs/2006.10456},
year = {2020},
url = {https://arxiv.org/abs/2006.10456},
eprinttype = {arXiv},
eprint = {2006.10456},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-10456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-06098,
author = {Sepehr Assadi and
Deeparnab Chakrabarty and
Sanjeev Khanna},
title = {Graph Connectivity and Single Element Recovery via Linear and {OR}
Queries},
journal = {CoRR},
volume = {abs/2007.06098},
year = {2020},
url = {https://arxiv.org/abs/2007.06098},
eprinttype = {arXiv},
eprint = {2007.06098},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-06098.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-04148,
author = {Sepehr Assadi and
Aaron Bernstein and
Zachary Langley},
title = {Improved Bounds for Distributed Load Balancing},
journal = {CoRR},
volume = {abs/2008.04148},
year = {2020},
url = {https://arxiv.org/abs/2008.04148},
eprinttype = {arXiv},
eprint = {2008.04148},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-04148.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-01161,
author = {Sepehr Assadi and
Ran Raz},
title = {Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms},
journal = {CoRR},
volume = {abs/2009.01161},
year = {2020},
url = {https://arxiv.org/abs/2009.01161},
eprinttype = {arXiv},
eprint = {2009.01161},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-01161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-03038,
author = {Sepehr Assadi and
Gillat Kol and
Raghuvansh R. Saxena and
Huacheng Yu},
title = {Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT,
Matching Size, and Other Problems},
journal = {CoRR},
volume = {abs/2009.03038},
year = {2020},
url = {https://arxiv.org/abs/2009.03038},
eprinttype = {arXiv},
eprint = {2009.03038},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-03038.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-01420,
author = {Sepehr Assadi and
Thomas Kesselheim and
Sahil Singla},
title = {Improved Truthful Mechanisms for Subadditive Combinatorial Auctions:
Breaking the Logarithmic Barrier},
journal = {CoRR},
volume = {abs/2010.01420},
year = {2020},
url = {https://arxiv.org/abs/2010.01420},
eprinttype = {arXiv},
eprint = {2010.01420},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-01420.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-07414,
author = {Sepehr Assadi and
Hrishikesh Khandeparkar and
Raghuvansh R. Saxena and
S. Matthew Weinberg},
title = {Separating the Communication Complexity of Truthful and Non-Truthful
Combinatorial Auctions},
journal = {CoRR},
volume = {abs/2011.07414},
year = {2020},
url = {https://arxiv.org/abs/2011.07414},
eprinttype = {arXiv},
eprint = {2011.07414},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-07414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AssadiKL19,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {The Stochastic Matching Problem with (Very) Few Queries},
journal = {{ACM} Trans. Economics and Comput.},
volume = {7},
number = {3},
pages = {16:1--16:19},
year = {2019},
url = {https://doi.org/10.1145/3355903},
doi = {10.1145/3355903},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/AssadiKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Assadi019,
author = {Sepehr Assadi and
Sahil Singla},
editor = {David Zuckerman},
title = {Improved Truthful Mechanisms for Combinatorial Auctions with Submodular
Bidders},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {233--248},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00024},
doi = {10.1109/FOCS.2019.00024},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/Assadi019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AssadiS19,
author = {Sepehr Assadi and
Shay Solomon},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {When Algorithms for Maximal Independent Set and Maximal Matching Run
in Sublinear Time},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {17:1--17:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.17},
doi = {10.4230/LIPICS.ICALP.2019.17},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AssadiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/AssadiBM19,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Vahab S. Mirrokni},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Distributed Weighted Matching via Randomized Composable Coresets},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {333--343},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/assadi19a.html},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/AssadiBM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AssadiKK19,
author = {Sepehr Assadi and
Michael Kapralov and
Sanjeev Khanna},
editor = {Avrim Blum},
title = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
via Edge Sampling},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.6},
doi = {10.4230/LIPICS.ITCS.2019.6},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AssadiKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AssadiBL19,
author = {Sepehr Assadi and
Eric Balkanski and
Renato Paes Leme},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Secretary Ranking with Minimal Inversions},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {1049--1061},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/3871bd64012152bfb53fdf04b401193f-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/AssadiBL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AssadiSW19,
author = {Sepehr Assadi and
Xiaorui Sun and
Omri Weinstein},
editor = {Peter Robinson and
Faith Ellen},
title = {Massively Parallel Algorithms for Finding Well-Connected Components
in Sparse Graphs},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {461--470},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331596},
doi = {10.1145/3293611.3331596},
timestamp = {Fri, 19 Jul 2019 08:02:49 +0200},
biburl = {https://dblp.org/rec/conf/podc/AssadiSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AssadiKZ19,
author = {Sepehr Assadi and
Nikolai Karpov and
Qin Zhang},
editor = {Dan Suciu and
Sebastian Skritek and
Christoph Koch},
title = {Distributed and Streaming Linear Programming in Low Dimensions},
booktitle = {Proceedings of the 38th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2019, Amsterdam, The Netherlands, June
30 - July 5, 2019},
pages = {236--253},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3294052.3319697},
doi = {10.1145/3294052.3319697},
timestamp = {Sun, 20 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/AssadiKZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiB19,
author = {Sepehr Assadi and
Aaron Bernstein},
editor = {Jeremy T. Fineman and
Michael Mitzenmacher},
title = {Towards a Unified Theory of Sparsification for Matching Problems},
booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
2019, San Diego, CA, {USA}},
series = {OASIcs},
volume = {69},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
doi = {10.4230/OASICS.SOSA.2019.11},
timestamp = {Tue, 15 Feb 2022 09:40:03 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalAK19,
author = {Arpit Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
editor = {Timothy M. Chan},
title = {Stochastic Submodular Cover with Limited Adaptivity},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {323--342},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.21},
doi = {10.1137/1.9781611975482.21},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AgarwalAK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiCK19,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
editor = {Timothy M. Chan},
title = {Sublinear Algorithms for ({\(\Delta\)} + 1) Vertex Coloring},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {767--786},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.48},
doi = {10.1137/1.9781611975482.48},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiBBMS19,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
editor = {Timothy M. Chan},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1616--1635},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.98},
doi = {10.1137/1.9781611975482.98},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiBBMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiOSS19,
author = {Sepehr Assadi and
Krzysztof Onak and
Baruch Schieber and
Shay Solomon},
editor = {Timothy M. Chan},
title = {Fully Dynamic Maximal Independent Set with Sublinear in n Update Time},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {1919--1936},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.116},
doi = {10.1137/1.9781611975482.116},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AssadiOSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiCK19,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
editor = {Moses Charikar and
Edith Cohen},
title = {Polynomial pass lower bounds for graph streaming algorithms},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {265--276},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316361},
doi = {10.1145/3313276.3316361},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-05617,
author = {Sepehr Assadi and
Nikolai Karpov and
Qin Zhang},
title = {Distributed and Streaming Linear Programming in Low Dimensions},
journal = {CoRR},
volume = {abs/1903.05617},
year = {2019},
url = {http://arxiv.org/abs/1903.05617},
eprinttype = {arXiv},
eprint = {1903.05617},
timestamp = {Sun, 20 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-05617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-04720,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
title = {Polynomial Pass Lower Bounds for Graph Streaming Algorithms},
journal = {CoRR},
volume = {abs/1904.04720},
year = {2019},
url = {http://arxiv.org/abs/1904.04720},
eprinttype = {arXiv},
eprint = {1904.04720},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-04720.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-01993,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Vahab S. Mirrokni},
title = {Distributed Weighted Matching via Randomized Composable Coresets},
journal = {CoRR},
volume = {abs/1906.01993},
year = {2019},
url = {http://arxiv.org/abs/1906.01993},
eprinttype = {arXiv},
eprint = {1906.01993},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-01993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-02716,
author = {Sepehr Assadi and
Sahil Singla},
title = {Improved Truthful Mechanisms for Combinatorial Auctions with Submodular
Bidders},
journal = {CoRR},
volume = {abs/1911.02716},
year = {2019},
url = {http://arxiv.org/abs/1911.02716},
eprinttype = {arXiv},
eprint = {1911.02716},
timestamp = {Wed, 13 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-02716.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiK18,
author = {Sepehr Assadi and
Sanjeev Khanna},
editor = {Artur Czumaj},
title = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
Problem},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2412--2431},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.155},
doi = {10.1137/1.9781611975031.155},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiOSS18,
author = {Sepehr Assadi and
Krzysztof Onak and
Baruch Schieber and
Shay Solomon},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Fully dynamic maximal independent set with sublinear update time},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {815--826},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188922},
doi = {10.1145/3188745.3188922},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiOSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02793,
author = {Sepehr Assadi and
Sanjeev Khanna},
title = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
Problem},
journal = {CoRR},
volume = {abs/1801.02793},
year = {2018},
url = {http://arxiv.org/abs/1801.02793},
eprinttype = {arXiv},
eprint = {1801.02793},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-02793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09709,
author = {Sepehr Assadi and
Krzysztof Onak and
Baruch Schieber and
Shay Solomon},
title = {Fully Dynamic Maximal Independent Set with Sublinear Update Time},
journal = {CoRR},
volume = {abs/1802.09709},
year = {2018},
url = {http://arxiv.org/abs/1802.09709},
eprinttype = {arXiv},
eprint = {1802.09709},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-09709.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02974,
author = {Sepehr Assadi and
Xiaorui Sun and
Omri Weinstein},
title = {Massively Parallel Algorithms for Finding Well-Connected Components
in Sparse Graphs},
journal = {CoRR},
volume = {abs/1805.02974},
year = {2018},
url = {http://arxiv.org/abs/1805.02974},
eprinttype = {arXiv},
eprint = {1805.02974},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02974.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10051,
author = {Sepehr Assadi and
Krzysztof Onak and
Baruch Schieber and
Shay Solomon},
title = {Fully Dynamic Maximal Independent Set with Sublinear in n Update Time},
journal = {CoRR},
volume = {abs/1806.10051},
year = {2018},
url = {http://arxiv.org/abs/1806.10051},
eprinttype = {arXiv},
eprint = {1806.10051},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-10051.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08886,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
title = {Sublinear Algorithms for ({\(\Delta\)}+ 1) Vertex Coloring},
journal = {CoRR},
volume = {abs/1807.08886},
year = {2018},
url = {http://arxiv.org/abs/1807.08886},
eprinttype = {arXiv},
eprint = {1807.08886},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-08886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13351,
author = {Arpit Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
title = {Stochastic Submodular Cover with Limited Adaptivity},
journal = {CoRR},
volume = {abs/1810.13351},
year = {2018},
url = {http://arxiv.org/abs/1810.13351},
eprinttype = {arXiv},
eprint = {1810.13351},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-13351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02009,
author = {Sepehr Assadi and
Aaron Bernstein},
title = {Towards a Unified Theory of Sparsification for Matching Problems},
journal = {CoRR},
volume = {abs/1811.02009},
year = {2018},
url = {http://arxiv.org/abs/1811.02009},
eprinttype = {arXiv},
eprint = {1811.02009},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-02009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-06444,
author = {Sepehr Assadi and
Eric Balkanski and
Renato Paes Leme},
title = {Secretary Ranking with Minimal Inversions},
journal = {CoRR},
volume = {abs/1811.06444},
year = {2018},
url = {http://arxiv.org/abs/1811.06444},
eprinttype = {arXiv},
eprint = {1811.06444},
timestamp = {Sun, 25 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-06444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-07780,
author = {Sepehr Assadi and
Michael Kapralov and
Sanjeev Khanna},
title = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
via Edge Sampling},
journal = {CoRR},
volume = {abs/1811.07780},
year = {2018},
url = {http://arxiv.org/abs/1811.07780},
eprinttype = {arXiv},
eprint = {1811.07780},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-07780.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Assadi17,
author = {Sepehr Assadi},
title = {{SPAA} 2017 Review},
journal = {{SIGACT} News},
volume = {48},
number = {4},
pages = {87--90},
year = {2017},
url = {https://doi.org/10.1145/3173127.3173142},
doi = {10.1145/3173127.3173142},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Assadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AhmadinejadAEYZ17,
author = {AmirMahdi Ahmadinejad and
Sepehr Assadi and
Ehsan Emamjomeh{-}Zadeh and
Sadra Yazdanbod and
Hamid Zarrabi{-}Zadeh},
title = {On the rectangle escape problem},
journal = {Theor. Comput. Sci.},
volume = {689},
pages = {126--136},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.05.040},
doi = {10.1016/J.TCS.2017.05.040},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AhmadinejadAEYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AssadiKLV17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh Vohra},
title = {Fast Convergence in the Double Oral Auction},
journal = {{ACM} Trans. Economics and Comput.},
volume = {5},
number = {4},
pages = {20:1--20:18},
year = {2017},
url = {https://doi.org/10.1145/3084358},
doi = {10.1145/3084358},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/teco/AssadiKLV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Agarwal0AK17,
author = {Arpit Agarwal and
Shivani Agarwal and
Sepehr Assadi and
Sanjeev Khanna},
editor = {Satyen Kale and
Ohad Shamir},
title = {Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed
Bandits, and Ranking from Pairwise Comparisons},
booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
Amsterdam, The Netherlands, 7-10 July 2017},
series = {Proceedings of Machine Learning Research},
volume = {65},
pages = {39--75},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v65/agarwal17c.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/Agarwal0AK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Assadi17,
author = {Sepehr Assadi},
editor = {Emanuel Sallinger and
Jan Van den Bussche and
Floris Geerts},
title = {Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set
Cover Problem},
booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
pages = {321--335},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3034786.3056116},
doi = {10.1145/3034786.3056116},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Assadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Constantinos Daskalakis and
Moshe Babaioff and
Herv{\'{e}} Moulin},
title = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
Algorithm},
booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
{EC} '17, Cambridge, MA, USA, June 26-30, 2017},
pages = {99--116},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3033274.3085146},
doi = {10.1145/3033274.3085146},
timestamp = {Mon, 30 Jan 2023 21:01:44 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/Assadi17,
author = {Sepehr Assadi},
editor = {Constantinos Daskalakis and
Moshe Babaioff and
Herv{\'{e}} Moulin},
title = {Combinatorial Auctions Do Need Modest Interaction},
booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
{EC} '17, Cambridge, MA, USA, June 26-30, 2017},
pages = {145--162},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3033274.3085121},
doi = {10.1145/3033274.3085121},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sigecom/Assadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Philip N. Klein},
title = {On Estimating Maximum Matching Size in Graph Streams},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1723--1742},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.113},
doi = {10.1137/1.9781611974782.113},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AssadiK17,
author = {Sepehr Assadi and
Sanjeev Khanna},
editor = {Christian Scheideler and
Mohammad Taghi Hajiaghayi},
title = {Randomized Composable Coresets for Matching and Vertex Cover},
booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
pages = {3--12},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087556.3087581},
doi = {10.1145/3087556.3087581},
timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AssadiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {On Estimating Maximum Matching Size in Graph Streams},
journal = {CoRR},
volume = {abs/1701.04364},
year = {2017},
url = {http://arxiv.org/abs/1701.04364},
eprinttype = {arXiv},
eprint = {1701.04364},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Assadi17,
author = {Sepehr Assadi},
title = {Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set
Cover Problem},
journal = {CoRR},
volume = {abs/1703.01847},
year = {2017},
url = {http://arxiv.org/abs/1703.01847},
eprinttype = {arXiv},
eprint = {1703.01847},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Assadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Assadi17a,
author = {Sepehr Assadi},
title = {Combinatorial Auctions Do Need Modest Interaction},
journal = {CoRR},
volume = {abs/1705.01644},
year = {2017},
url = {http://arxiv.org/abs/1705.01644},
eprinttype = {arXiv},
eprint = {1705.01644},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Assadi17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17a,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
Algorithm},
journal = {CoRR},
volume = {abs/1705.02280},
year = {2017},
url = {http://arxiv.org/abs/1705.02280},
eprinttype = {arXiv},
eprint = {1705.02280},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiK17,
author = {Sepehr Assadi and
Sanjeev Khanna},
title = {Randomized Composable Coresets for Matching and Vertex Cover},
journal = {CoRR},
volume = {abs/1705.08242},
year = {2017},
url = {http://arxiv.org/abs/1705.08242},
eprinttype = {arXiv},
eprint = {1705.08242},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04599,
author = {Sepehr Assadi},
title = {Simple Round Compression for Parallel Vertex Cover},
journal = {CoRR},
volume = {abs/1709.04599},
year = {2017},
url = {http://arxiv.org/abs/1709.04599},
eprinttype = {arXiv},
eprint = {1709.04599},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-04599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03076,
author = {Sepehr Assadi and
MohammadHossein Bateni and
Aaron Bernstein and
Vahab S. Mirrokni and
Cliff Stein},
title = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
Massive Graphs},
journal = {CoRR},
volume = {abs/1711.03076},
year = {2017},
url = {http://arxiv.org/abs/1711.03076},
eprinttype = {arXiv},
eprint = {1711.03076},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/taco/KafshdoozTAE16,
author = {Morteza Mohajjel Kafshdooz and
Mohammadkazem Taram and
Sepehr Assadi and
Alireza Ejlali},
title = {A Compile-Time Optimization Method for {WCET} Reduction in Real-Time
Embedded Systems through Block Formation},
journal = {{ACM} Trans. Archit. Code Optim.},
volume = {12},
number = {4},
pages = {66:1--66:25},
year = {2016},
url = {https://doi.org/10.1145/2845083},
doi = {10.1145/2845083},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/taco/KafshdoozTAE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AssadiKLT16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
editor = {Wim Martens and
Thomas Zeume},
title = {Algorithms for Provisioning Queries and Analytics},
booktitle = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
France, March 15-18, 2016},
series = {LIPIcs},
volume = {48},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2016.18},
doi = {10.4230/LIPICS.ICDT.2016.18},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icdt/AssadiKLT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Vincent Conitzer and
Dirk Bergemann and
Yiling Chen},
title = {The Stochastic Matching Problem with (Very) Few Queries},
booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation,
{EC} '16, Maastricht, The Netherlands, July 24-28, 2016},
pages = {43--60},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2940716.2940769},
doi = {10.1145/2940716.2940769},
timestamp = {Fri, 09 Jul 2021 11:46:27 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKLY16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Grigory Yaroslavtsev},
editor = {Robert Krauthgamer},
title = {Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication
Model},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1345--1364},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch93},
doi = {10.1137/1.9781611974331.CH93},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/AssadiKLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Tight bounds for single-pass streaming complexity of the set cover
problem},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {698--711},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897576},
doi = {10.1145/2897518.2897576},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
title = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover
Problem},
journal = {CoRR},
volume = {abs/1603.05715},
year = {2016},
url = {http://arxiv.org/abs/1603.05715},
eprinttype = {arXiv},
eprint = {1603.05715},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AssadiKLT15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Dynamic Sketching for Graph Optimization Problems with Applications
to Cut-Preserving Sketches},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {52--68},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52},
doi = {10.4230/LIPICS.FSTTCS.2015.52},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AssadiKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hcomp/AssadiHJ15,
author = {Sepehr Assadi and
Justin Hsu and
Shahin Jabbari},
editor = {Elizabeth Gerber and
Panos Ipeirotis},
title = {Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets},
booktitle = {Proceedings of the Third {AAAI} Conference on Human Computation and
Crowdsourcing, {HCOMP} 2015, November 8-11, 2015, San Diego, California,
{USA}},
pages = {12--21},
publisher = {{AAAI} Press},
year = {2015},
url = {https://doi.org/10.1609/hcomp.v3i1.13236},
doi = {10.1609/HCOMP.V3I1.13236},
timestamp = {Tue, 05 Sep 2023 11:10:11 +0200},
biburl = {https://dblp.org/rec/conf/hcomp/AssadiHJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AssadiKLV15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh V. Vohra},
editor = {Evangelos Markakis and
Guido Sch{\"{a}}fer},
title = {Fast Convergence in the Double Oral Auction},
booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9470},
pages = {60--73},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48995-6\_5},
doi = {10.1007/978-3-662-48995-6\_5},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/AssadiKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLY15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Grigory Yaroslavtsev},
title = {Tight Bounds for Linear Sketches of Approximate Matchings},
journal = {CoRR},
volume = {abs/1505.01467},
year = {2015},
url = {http://arxiv.org/abs/1505.01467},
eprinttype = {arXiv},
eprint = {1505.01467},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiHJ15,
author = {Sepehr Assadi and
Justin Hsu and
Shahin Jabbari},
title = {Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets},
journal = {CoRR},
volume = {abs/1508.03593},
year = {2015},
url = {http://arxiv.org/abs/1508.03593},
eprinttype = {arXiv},
eprint = {1508.03593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiHJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLV15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Rakesh Vohra},
title = {Fast Convergence in the Double Oral Auction},
journal = {CoRR},
volume = {abs/1510.00086},
year = {2015},
url = {http://arxiv.org/abs/1510.00086},
eprinttype = {arXiv},
eprint = {1510.00086},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
title = {Dynamic Sketching for Graph Optimization Problems with Applications
to Cut-Preserving Sketches},
journal = {CoRR},
volume = {abs/1510.03252},
year = {2015},
url = {http://arxiv.org/abs/1510.03252},
eprinttype = {arXiv},
eprint = {1510.03252},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15a,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li and
Val Tannen},
title = {Algorithms for Provisioning Queries and Analytics},
journal = {CoRR},
volume = {abs/1512.06143},
year = {2015},
url = {http://arxiv.org/abs/1512.06143},
eprinttype = {arXiv},
eprint = {1512.06143},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AssadiKLT15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AssadiENYZ14,
author = {Sepehr Assadi and
Ehsan Emamjomeh{-}Zadeh and
Ashkan Norouzi{-}Fard and
Sadra Yazdanbod and
Hamid Zarrabi{-}Zadeh},
title = {The Minimum Vulnerability Problem},
journal = {Algorithmica},
volume = {70},
number = {4},
pages = {718--731},
year = {2014},
url = {https://doi.org/10.1007/s00453-014-9927-z},
doi = {10.1007/S00453-014-9927-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AssadiENYZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AssadiEYZ13,
author = {Sepehr Assadi and
Ehsan Emamjomeh{-}Zadeh and
Sadra Yazdanbod and
Hamid Zarrabi{-}Zadeh},
title = {On the Rectangle Escape Problem},
booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
{CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
publisher = {Carleton University, Ottawa, Canada},
year = {2013},
url = {http://cccg.ca/proceedings/2013/papers/paper\_78.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AssadiEYZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AssadiENYZ12,
author = {Sepehr Assadi and
Ehsan Emamjomeh{-}Zadeh and
Ashkan Norouzi{-}Fard and
Sadra Yazdanbod and
Hamid Zarrabi{-}Zadeh},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {The Minimum Vulnerability Problem},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {382--391},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_41},
doi = {10.1007/978-3-642-35261-4\_41},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AssadiENYZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 18:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
