Broadcasting with random faults
Discrete Applied Mathematics
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Broadcasting in a hypercube when some calls fail
Information Processing Letters
Broadcasting in complete networks with faulty nodes using unreliable recalls
Information Processing Letters
Almost safe gossiping in bounded degree networks
SIAM Journal on Discrete Mathematics
Asymptotically Optimal Broadcasting and Gossiping in Faulty Hypercube Multicomputers
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Fault tolerance of the star graph interconnection network
Information Processing Letters
On optimal broadcasting in faulty hypercubes
Proceedings of the international workshop on Broadcasting and gossiping 1990
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting in faulty binary jumping networks
Journal of Parallel and Distributed Computing
A note on optimal time broadcast in faulty hypercubes
Journal of Parallel and Distributed Computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
Adaptive broadcasting with faulty nodes
Parallel Computing
Reliable broadcasting in logarithmic time with Byzantine link failures
Journal of Algorithms
Broadcasting with a bounded fraction of faulty nodes
Journal of Parallel and Distributed Computing
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Broadcasting with linearly bounded transmission faults
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Communication complexity of fault-tolerant information diffusion
Theoretical Computer Science
Broadcasting in hypercubes and star graphs with dynamic faults
Information Processing Letters
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
Distributed Algorithms
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Distributed Function Evaluation in the Presence of Transmission Faults
SIGAL '90 Proceedings of the International Symposium on Algorithms
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Directed virtual path layouts in ATM networks
Theoretical Computer Science - Special issue: Distributed computing
Dynamic faults have small effect on broadcasting in hypercubes
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Optimal graph exploration without good maps
Theoretical Computer Science
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
On fractional dynamic faults with threshold
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Communication in networks with random dependent faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms.