scientific article; zbMATH DE number 3990833

zbMATH Open0612.68006MaRDI QIDQ3753460FDOQ3753460

Zvi Galil, Moti Yung, Gad M. Landau

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4072376
• Gossiping and broadcasting versus computing functions in networks.
• Gossiping and broadcasting versus computing functions in networks
• Methods and problems of communication in usual networks
• Computing functions on asynchronous anonymous networks

zbMATH Keywords

distributed computinglower boundscommunication complexityinformation sharingsorting networksprobabilistic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication theory (94A05) Searching and sorting (68P10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Theory of software (68N99) Algorithms in computer science (68W99)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Power of Broadcasting in Mobile Computing
• Fast distributed algorithms to make mutually coordinated decisions in stringent real time
• Distributed algorithms in synchronous broadcasting networks
• Distributed Random Access Algorithm: Scheduling and Congestion Control

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