scientific article; zbMATH DE number 4068275

MaRDI QIDQ3801068zbMATH OpenFDO

Authors Alberto Negro, J. Urrutia, N. Santoro

Publication date 1988

zbMATH Keywords

bit complexitycommunication complexitydistributed selectionmessage complexitynetwork topologiespacket complexity

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 4050993
• Distributed algorithms for selection in sets
• A distributed selection algorithm and its expected communication complexity
• Bit complexity of order statistics on a distributed star network
• On the message complexity of distributed problems

Cited in

(4)

• A distributed selection algorithm and its expected communication complexity
• scientific article; zbMATH DE number 4145830 (Why is no real title available?)
• scientific article; zbMATH DE number 4050993 (Why is no real title available?)
• Time vs bits

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 Q3801068)