scientific article; zbMATH DE number 3800917

MaRDI QIDQ4745251zbMATH OpenFDO

Authors Ephraim Korach, Doron Rotem, N. Santoro

Publication date 1982

zbMATH Keywords

asynchronous networkefficient algorithmsmessage complexity

Mathematics Subject Classification ID

Theory of operating systems (68N25) Applications of graph theory to circuits and networks (94C15)

Cited in

(3)

• Bit complexity of order statistics on a distributed star network
• A distributed selection algorithm and its expected communication complexity
• On the message complexity of distributed problems

This page was built for publication:

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