A note on weighted distributed match-making

DOI10.1007/BF02835832MaRDI QIDQ4000865zbMATH OpenOpenAlexFDO

Authors Paul M. B. Vitányi, Evangelos Kranakis

Publication date 26 September 1992

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02835832

zbMATH Keywords

distributed systemlower boundsstore-and-forward networksuccess-stop

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 4062556
• Distributed match-making
• Distributed Weighted Matching
• Construction of optimal communication structures for weighted distributed match-making
• Efficient Distributed Weighted Matchings on Trees

Cites work

• Distributed match-making

Cited in

(7)

• Distributed match-making
• \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
• Distributed Weighted Stable Marriage Problem
• scientific article; zbMATH DE number 4062556 (Why is no real title available?)
• Construction of optimal communication structures for weighted distributed match-making
• scientific article; zbMATH DE number 6866348 (Why is no real title available?)
• The Match-Maker: Constant-Space Distributed Majority via Random Walks

This page was built for publication: A note on weighted distributed match-making

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4000865)