Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlireza Farhadi 0001
Person information
- affiliation: Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA
- affiliation (former, PhD 2022): University of Maryland, College Park, MD, USA
Other persons with the same name
- Alireza Farhadi — disambiguation page
- Alireza Farhadi 0002 — University of Ottawa, ON, Canada
- Alireza Farhadi 0003
![[0000-0001-7409-0385]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7409-0385")
— Sharif University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Mahsa Derakhshan, Alireza Farhadi:
Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching. SODA 2023: 1931-1961- [i13]Alireza Farhadi, S. Cliff Liu, Elaine Shi:
Connected Components in Linear Work and Near-Optimal Time. CoRR abs/2312.02332 (2023) - 2022
- [b1]Alireza Farhadi:
Memory-Restricted and Secure Algorithms For Large Datasets. University of Maryland, College Park, MD, USA, 2022 - [c13]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. AAAI 2022: 10008-10015 - [c12]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. AISTATS 2022: 11581-11597 - [c11]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. EC 2022: 962-963 - [i12]Alireza Farhadi, Jacob Gilbert, MohammadTaghi Hajiaghayi:
Generalized Stochastic Matching. CoRR abs/2205.14717 (2022) - [i11]Mahsa Derakhshan, Alireza Farhadi:
Beating (1-1/e)-Approximation for Weighted Stochastic Matching. CoRR abs/2210.17515 (2022) - 2021
- [c10]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. AAAI 2021: 5355-5362 - [c9]Kuan Cheng, Alireza Farhadi, MohammadTaghi Hajiaghayi, Zhengzhong Jin, Xin Li, Aviad Rubinstein, Saeed Seddighin, Yu Zheng:
Streaming and Small Space Approximation Algorithms for Edit Distance and Longest Common Subsequence. ICALP 2021: 54:1-54:20 - [i10]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. CoRR abs/2106.00508 (2021) - [i9]Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan:
Online Bipartite Matching with Reusable Resources. CoRR abs/2110.07084 (2021) - 2020
- [j2]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. Commun. ACM 63(10): 97-105 (2020) - [c8]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi:
Approximate Maximum Matching in Random Streams. SODA 2020: 1773-1785 - [i8]Alireza Farhadi, MohammadTaghi Hajiaghayi, Aviad Rubinstein, Saeed Seddighin:
Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS. CoRR abs/2002.11342 (2020) - [i7]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian, Masoud Seddighin, Hadi Yami:
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings. CoRR abs/2007.07027 (2020)
2010 – 2019
- 2019
- [j1]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [c7]Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - [c6]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. SODA 2019: 1055-1068 - [c5]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. SODA 2019: 2855-2874 - [c4]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. STOC 2019: 997-1008 - [i6]Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai, Anup Rao, Ryan A. Rossi:
Approximate Maximum Matching in Random Streams. CoRR abs/1912.10497 (2019) - 2018
- [c3]Alireza Farhadi, MohammadTaghi Hajiaghayi:
On the Complexity of Chore Division. IJCAI 2018: 226-232 - [c2]Sina Dehghani, Alireza Farhadi, Mohammad Taghi Hajiaghayi, Hadi Yami:
Envy-free Chore Division for An Arbitrary Number of Agents. SODA 2018: 2564-2583 - [i5]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower Bounds for External Memory Integer Sorting via Network Coding. CoRR abs/1811.01313 (2018) - [i4]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. CoRR abs/1811.03224 (2018) - [i3]MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi:
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs. CoRR abs/1811.04052 (2018) - 2017
- [c1]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS 2017: 1535-1537 - [i2]Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR abs/1703.01649 (2017) - [i1]Alireza Farhadi, MohammadTaghi Hajiaghayi:
On the Complexity of Chore Division. CoRR abs/1710.00271 (2017)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:48 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:
