Sebastian Brandt 0002, Dennis Olivetti. Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants. In Yuval Emek, Christian Cachin, editors, PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020. pages 69-78, ACM, 2020. [doi]
@inproceedings{0002O20,
title = {Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants},
author = {Sebastian Brandt 0002 and Dennis Olivetti},
year = {2020},
doi = {10.1145/3382734.3405745},
url = {https://doi.org/10.1145/3382734.3405745},
researchr = {https://researchr.org/publication/0002O20},
cites = {0},
citedby = {0},
pages = {69-78},
booktitle = {PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020},
editor = {Yuval Emek and Christian Cachin},
publisher = {ACM},
isbn = {978-1-4503-7582-5},
}