15 citations · 75 across the 31 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Approximate Maximum Matching in Random Streams
Alireza Farhadi, MohammadTaghi Hajiaghayi, Tung Mai +2
In this paper, we study the problem of finding a maximum matching in the semi-streaming model when edges arrive in a random order. In the semi-streaming model, an algorithm receive…
cs.GT2019★ 3 cited
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds
Karthik Gajulapalli, James Liu, Tung Mai +1
We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally-separated rounds, denoted and $\mathca…