Alireza Farhadi

Affiliations:
  • Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA
  • University of Maryland, College Park, MD, USA (former, PhD 2022)


According to our database1, Alireza Farhadi authored at least 17 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Connected Components in Linear Work and Near-Optimal Time.
CoRR, 2023

Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Memory-Restricted and Secure Algorithms For Large Datasets.
PhD thesis, 2022

Online Bipartite Matching with Reusable Resources.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Differentially Private Densest Subgraph.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Generalized Stochastic Matching.
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.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

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

Lower bounds for external memory integer sorting via network coding.
Commun. ACM, 2020

Approximate Maximum Matching in Random Streams.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Fair Allocation of Indivisible Goods to Asymmetric Agents.
J. Artif. Intell. Res., 2019

Stochastic Matching with Few Queries: New Algorithms and Tools.
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.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Stochastic Matching on Uniformly Sparse Graphs.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2018
Envy-free Chore Division for An Arbitrary Number of Agents.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

On the Complexity of Chore Division.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018


  Loading...