Optimal computation of census functions in the postal model

DOI10.1016/0166-218X(94)E0148-6zbMATH Open0941.68821OpenAlexW2012959501MaRDI QIDQ1804885FDOQ1804885

Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber

Publication date: 26 February 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)e0148-6

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• Title not available (Why is that?)
• New gossips and telephones
• New models and algorithms for future networks
• Multiple message broadcasting in the postal model

Cited In (1)

• Optimal point-to-point broadcast algorithms via lopsided trees

This page was built for publication: Optimal computation of census functions in the postal model

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