Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

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]

Authors

Sebastian Brandt 0002

This author has not been identified. Look up 'Sebastian Brandt 0002' in Google

Dennis Olivetti

This author has not been identified. Look up 'Dennis Olivetti' in Google