Alireza Farhadi

According to our database, Alireza Farhadi authored at least 18 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Online Bipartite Matching with Reusable Resources.

Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan, Rajan Udwani

Math. Oper. Res., 2024

Connected Components in Linear Work and Near-Optimal Time.

Alireza Farhadi, Sixue Cliff Liu, Elaine Shi

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023

Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching.

Mahsa Derakhshan, Alireza Farhadi

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Memory-Restricted and Secure Algorithms For Large Datasets.

Alireza Farhadi

PhD thesis, 2022

Online Bipartite Matching with Reusable Resources.

Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Differentially Private Densest Subgraph.

Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Generalized Stochastic Matching.

Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence.

Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings.

Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS.

Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin

CoRR, 2020

Lower bounds for external memory integer sorting via network coding.

Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi

Commun. ACM, 2020

Approximate Maximum Matching in Random Streams.

Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.

Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami

J. Artif. Intell. Res., 2019

Stochastic Matching with Few Queries: New Algorithms and Tools.

Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.

MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Matching on Uniformly Sparse Graphs.

Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2018

Envy-free Chore Division for An Arbitrary Number of Agents.

Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On the Complexity of Chore Division.

Alireza Farhadi, MohammadTaghi Hajiaghayi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018