2 citations · 4 across the 16 of their papers we have counts for
1 paper · 1 filter
Joakim Blikstad, Jan van den Brand, Yuval Efron +2
We settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up to poly-logarithmic factors in five models of computation: the two-party communication, AN…