E-LIB Suche - Ergebnisse für: Farhadi, Alireza

1

Connected Components in Linear Work and Near-Optimal Time:

Farhadi, Alireza ; Liu, S. Cliff ; Shi, Elaine
http://arxiv.org/abs/2312.02332. , 2023

Link: http://arxiv.org/abs/231..

2

Generalized Stochastic Matching:

Farhadi, Alireza ; Gilbert, Jacob ; Hajiaghayi, MohammadTaghi
http://arxiv.org/abs/2205.14717. , 2022

Link: http://arxiv.org/abs/220..

3

Beating $(1-1/e)$-Approximation for Weighted Stochastic Mat..:

Derakhshan, Mahsa ; Farhadi, Alireza
http://arxiv.org/abs/2210.17515. , 2022

Link: http://arxiv.org/abs/221..

4

Streaming and Small Space Approximation Algorithms for Edit..:

Cheng, Kuan ; Farhadi, Alireza ; Hajiaghayi, MohammadTaghi...
doi:10.4230/LIPIcs.ICALP.2021.54. , 2021

Link: https://doi.org/10.4230/..

5

Differentially Private Densest Subgraph:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Shi, Elaine
http://arxiv.org/abs/2106.00508. , 2021

Link: http://arxiv.org/abs/210..

6

Online Bipartite Matching with Reusable Resources:

Delong, Steven ; Farhadi, Alireza ; Niazadeh, Rad..
http://arxiv.org/abs/2110.07084. , 2021

Link: http://arxiv.org/abs/211..

7

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Ma..:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Latifian, Mohamad..
http://arxiv.org/abs/2007.07027. , 2020

Link: http://arxiv.org/abs/200..

8

Asymmetric Streaming Algorithms for Edit Distance and LCS:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Rubinstein, Aviad.
http://arxiv.org/abs/2002.11342. , 2020

Link: http://arxiv.org/abs/200..

9

Lower bounds for external memory integer sorting via networ..:

Farhadi, Alireza ; Hajiaghayi, Mohammad Taghi ; Larsen, Kasper Green.
Farhadi , A , Hajiaghayi , M T , Larsen , K G & Shi , E 2019 , Lower bounds for external memory integer sorting via network coding . in M Charikar & E Cohen (eds) , STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery , A C M Symposium on the Theory of Computing. Annual Proceedings , pp. 997-1008 , 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 , Phoenix , United States , 23/06/2019 . https://doi.org/10.1145/3313276.3316337. , 2019

Link: https://pure.au.dk/porta..

10

Approximate Maximum Matching in Random Streams:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Mai, Tung..
http://arxiv.org/abs/1912.10497. , 2019

Link: http://arxiv.org/abs/191..

11

Lower Bounds for External Memory Integer Sorting via Networ..:

Farhadi, Alireza ; Hajiaghayi, MohammadTaghi ; Larsen, Kasper Green.
http://arxiv.org/abs/1811.01313. , 2018

Link: http://arxiv.org/abs/181..

12

Polynomial-time Approximation Scheme for Minimum k-cut in P..:

Bateni, MohammadHossein ; Farhadi, Alireza ; Hajiaghayi, MohammadTaghi
http://arxiv.org/abs/1811.04052. , 2018

Link: http://arxiv.org/abs/181..

13

Stochastic Matching with Few Queries: New Algorithms and To..:

Behnezhad, Soheil ; Farhadi, Alireza ; Hajiaghayi, MohammadTaghi.
http://arxiv.org/abs/1811.03224. , 2018

Link: http://arxiv.org/abs/181..

14

Experiments on turbulence and near bank vorticities in an o..:

Farhadi Alireza ; Sindelar Christine ; Tritthart Michael.
https://doi.org/10.1051/e3sconf/20184005069. , 2018

Link: https://doi.org/10.1051/..

15

Fair Allocation of Indivisible Goods to Asymmetric Agents:

Farhadi, Alireza ; Ghodsi, Mohammad ; Hajiaghayi, MohammadTaghi...
http://arxiv.org/abs/1703.01649. , 2017

Link: http://arxiv.org/abs/170..