23 citations · 48 across the 24 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021★ 1 cited
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
Niv Buchbinder, Joseph, Naor +1
For numerous online bipartite matching problems, such as edge-weighted matching and matching under two-sided vertex arrivals, the state-of-the-art fractional algorithms outperform…
cs.CR2021★ 23 cited
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Niv Buchbinder, Iftach Haitner, Nissan Levi +1
In a multi-party fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some adversarial parties try to bias the output. In this work we focus…