Add to ORKGIncludes bibliographical references (p. 19-20).Cover title.Research supported by the NSF. NSF-DDM-8903385 Research supported by the ARO. DAAL03-b6-K-0171by Emmanouel A. Varvarigos and Dimitri P. Bertsekas
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
We present efficient algorithms for broadcasting multiple messages. We assume n processors, one of w...
AbstractA multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge o...
Includes bibliographical references (p. 9-10).Cover title.Research supported by the NSF. ECS-8552419...
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing ...
Includes bibliographical references (p. 25-26).Supported by the NSF. NSF-DDM-8903385 Supported by th...
Caption title. "Revision of January 1992."Includes bibliographical references (p. 24-26).Supported b...
We consider the following basic communication problems in a hypercube network of processors: the pro...
We present a randomized distributed algorithm that in radio networks with collision detection broadc...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
Broadcasting is an information dissemination problem in which information originating at one node of...
AbstractWe consider a broadcasting problem in the n-dimensional hypercube in the shouting communicat...
International audienceIn the broadcasting problem, one node needs to broadcast a message to all othe...
Dynamic broadcast is a communication problem where each node in a parallel computer generates packet...
We study the problem of broadcasting in a system where n nodes are placed on a line of length L inde...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
We present efficient algorithms for broadcasting multiple messages. We assume n processors, one of w...
AbstractA multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge o...
Includes bibliographical references (p. 9-10).Cover title.Research supported by the NSF. ECS-8552419...
The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing ...
Includes bibliographical references (p. 25-26).Supported by the NSF. NSF-DDM-8903385 Supported by th...
Caption title. "Revision of January 1992."Includes bibliographical references (p. 24-26).Supported b...
We consider the following basic communication problems in a hypercube network of processors: the pro...
We present a randomized distributed algorithm that in radio networks with collision detection broadc...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
Broadcasting is an information dissemination problem in which information originating at one node of...
AbstractWe consider a broadcasting problem in the n-dimensional hypercube in the shouting communicat...
International audienceIn the broadcasting problem, one node needs to broadcast a message to all othe...
Dynamic broadcast is a communication problem where each node in a parallel computer generates packet...
We study the problem of broadcasting in a system where n nodes are placed on a line of length L inde...
A multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge of the to...
We present efficient algorithms for broadcasting multiple messages. We assume n processors, one of w...
AbstractA multi-hop synchronous radio network is said to be unknown if the nodes have no knowledge o...