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

Authors

314

  1. SP
    Seth Pettie

    University of Michigan, United States

    6 publications · 494 citations

    6

    h-index

  2. ZH
    Zhu Han

    University of Houston, United States

    5 publications · 139 citations

    5

    h-index

  3. BP
    Boaz Patt-Shamir

    Tel Aviv University, Israel

    5 publications · 232 citations

    5

    h-index

  4. AP
    Alessandro Panconesi

    Sapienza University of Rome, Italy

    5 publications · 269 citations

    5

    h-index

  5. ZL
    Zvi Lotker

    Ben-Gurion University of the Negev, Israel

    4 publications · 218 citations

    4

    h-index

1–5 of 314

Venues

  1. arXiv (Cornell University)

    Repository · 6 publications · 183 citations

    6

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 256 citations

    4

    h-index

  3. Journal of the ACM

    JACM · 3 publications · 368 citations

    3

    h-index

  4. IEEE Internet of Things Journal

    3 publications · 112 citations

    3

    h-index

  5. IEEE Transactions on Wireless Communications

    2 publications · 133 citations

    2

    h-index

1–5