Distributed Matching Algorithms
Distributed Matching Algorithms is a computational framework within distributed algorithms that solves matching problems in a decentralized network by coordinating localized decision-making among autonomous nodes to achieve a globally consistent set of pairings under communication and synchrony constraints.
114
Publications
4.3K
Citations
314
Authors
164
Institutions
Publications per year
2017–2026
36
Parents
114
The Locality of Distributed Symmetry Breaking
Leonid Barenboim, Michael Elkin, Seth Pettie et al. · Journal of the ACM · 2016 · 175 citations
Simple Distributed Weighted Matchings
Jaap-Henk Hoepman · ArXiv.org · 2004 · 139 citations · Full text
1–5 of 114
314
6
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 314
164

Tel Aviv University
Tel Aviv, Israel
7 h-index
12 publications
334 citations
ETH Zurich
Zurich, Switzerland
6 h-index
6 publications
402 citations
Ben-Gurion University of the Negev
Beersheba, Israel
6 h-index
9 publications
836 citations
PLA Army Engineering University
Nanjing, China
5 h-index
21 publications
335 citations
University of Michigan
Ann Arbor, United States
5 h-index
5 publications
470 citations
University of Houston
Houston, United States
5 h-index
9 publications
225 citations

Adam Mickiewicz University in Poznań
Poznan, Poland
4 h-index
8 publications
353 citations
Emory University
Atlanta, United States
4 h-index
6 publications
283 citations
1–8 of 164
Repository · 6 publications · 183 citations
6
h-index
PVLDB · 4 publications · 256 citations
4
h-index
JACM · 3 publications · 368 citations
3
h-index
3 publications · 112 citations
3
h-index
2 publications · 133 citations
2
h-index
1–5