Distributed resource discovery in sub-logarithmic time

DOI10.1145/2767386.2767435MaRDI QIDQ2796278zbMATH OpenOpenAlexFDO

Authors Bernhard Haeupler, Dahlia Malkhi

Publication date 23 March 2016

Published in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2767386.2767435

zbMATH Keywords

direct addressinggossipinformation disseminationresource discoveryrumor spreading

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Asynchronous resource discovery
• Asynchronous resource discovery
• Deterministic resource discovery in distributed networks
• Algorithms for Resource Discovery in Distributed Networks
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(9)

• Deterministic resource discovery in distributed networks
• A deterministic worst-case message complexity optimal solution for resource discovery
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Algorithms for Resource Discovery in Distributed Networks
• Epistemic protocols for dynamic gossip
• Asynchronous resource discovery
• Asynchronous resource discovery
• Resource finding in store-and-forward networks
• Asynchronous resource discovery in peer-to-peer networks

This page was built for publication: Distributed resource discovery in sub-logarithmic time

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