15 citations · 21 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Online Matching with High Probability
Milena Mihail, Thorben Tröbst
We study the classical, randomized Ranking algorithm which is known to be -competitive in expectation for the Online Bipartite Matching Problem. We give a tail i…
cs.DS2012★ 6 cited
Efficient Generation ε-close to G(n,p) and Generalizations
Antonio Blanca, Milena Mihail
We give an efficient algorithm to generate a graph from a distribution -close to , in the sense of total variation distance. In particular, if is represented with $O…