Nearly Optimal Communication and Query Complexity of Bipartite Matching

التفاصيل البيبلوغرافية
العنوان: Nearly Optimal Communication and Query Complexity of Bipartite Matching
المؤلفون: Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon
المصدر: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :1174-1185 Oct, 2022
Relation: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
قاعدة البيانات: IEEE Xplore Digital Library
الوصف
ردمك:9781665455190
تدمد:25758454
DOI:10.1109/FOCS54457.2022.00113