Computing input multiplicity in anonymous synchronous networks with dynamic faults

DOI10.1016/j.jda.2004.04.004zbMath1118.68375OpenAlexW2046692948MaRDI QIDQ876726

Stefan Dobrev

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2004.04.004

zbMATH Keywords

fault tolerancedistributed algorithmsdynamic faultsinput collection

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

The Heard-Of model: computing in distributed systems with benign faults ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ On fractional dynamic faults with thresholds

Cites Work

• Broadcasting in a hypercube when some calls fail
• Optimal broadcasting in hypercubes with dynamic faults
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Computing functions on asynchronous anonymous networks
• Broadcasting in synchronous networks with dynamic faults
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Computing input multiplicity in anonymous synchronous networks with dynamic faults