Computing input multiplicity in anonymous synchronous networks with dynamic faults

DOI10.1016/J.JDA.2004.04.004zbMATH Open1118.68375OpenAlexW2046692948MaRDI QIDQ876726FDOQ876726

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

distributed algorithmsfault tolerancedynamic faultsinput collection

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Agreement in synchronous networks with ubiquitous faults
• The Heard-Of model: computing in distributed systems with benign faults
• Title not available (Why is that?)
• On fractional dynamic faults with thresholds

   Recommendations

• Title not available (Why is that?) 👍 👎
• Distributed Computing on Anonymous Hypercube Networks 👍 👎
• Computing functions on asynchronous anonymous networks 👍 👎
• Computing Boolean functions on anonymous networks 👍 👎
• Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations 👍 👎

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

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