skip to main content


Title: On the Robust Communication Complexity of Bipartite Matching
Award ID(s):
2047061
NSF-PAR ID:
10314128
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found