AAAAAA

   
Results: 1-14 |
Results: 14
OPTIMIZED BROADCASTING AND MULTICASTING PROTOCOLS IN CUT-THROUGH ROUTED NETWORKS
Authors: COHEN J FRAIGNIAUD P KONIG JC RASPAUD A
Citation: J. Cohen et al., OPTIMIZED BROADCASTING AND MULTICASTING PROTOCOLS IN CUT-THROUGH ROUTED NETWORKS, IEEE transactions on parallel and distributed systems, 9(8), 1998, pp. 788-802
A GENERAL-THEORY FOR DEADLOCK-AVOIDANCE IN WORMHOLE-ROUTED NETWORKS
Authors: FLEURY E FRAIGNIAUD P
Citation: E. Fleury et P. Fraigniaud, A GENERAL-THEORY FOR DEADLOCK-AVOIDANCE IN WORMHOLE-ROUTED NETWORKS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 626-638
STRATEGIES FOR PATH-BASED MULTICASTING IN WORMHOLE-ROUTED MESHES
Authors: FLEURY E FRAIGNIAUD P
Citation: E. Fleury et P. Fraigniaud, STRATEGIES FOR PATH-BASED MULTICASTING IN WORMHOLE-ROUTED MESHES, Journal of parallel and distributed computing (Print), 53(1), 1998, pp. 26-62
PARALLEL COMPUTING
Authors: BOUGE L FRAIGNIAUD P MIGNOTTE A ROBERT Y
Citation: L. Bouge et al., PARALLEL COMPUTING, Theoretical computer science, 196(1-2), 1998, pp. 1-1
ON XRAM AND PRAM MODELS, AND ON DATA-MOVEMENT-INTENSIVE PROBLEMS
Authors: FRAIGNIAUD P
Citation: P. Fraigniaud, ON XRAM AND PRAM MODELS, AND ON DATA-MOVEMENT-INTENSIVE PROBLEMS, Theoretical computer science, 194(1-2), 1998, pp. 225-237
INTERVAL ROUTING SCHEMES
Authors: FRAIGNIAUD P GAVOILLE C
Citation: P. Fraigniaud et C. Gavoille, INTERVAL ROUTING SCHEMES, Algorithmica, 21(2), 1998, pp. 155-182
APPROXIMATION ALGORITHMS FOR BROADCASTING AND GOSSIPING
Authors: FRAIGNIAUD P VIAL S
Citation: P. Fraigniaud et S. Vial, APPROXIMATION ALGORITHMS FOR BROADCASTING AND GOSSIPING, Journal of parallel and distributed computing, 43(1), 1997, pp. 47-55
UNIVERSAL ROUTING SCHEMES
Authors: FRAIGNIAUD P GAVOILLE C
Citation: P. Fraigniaud et C. Gavoille, UNIVERSAL ROUTING SCHEMES, Distributed computing, 10(2), 1997, pp. 65-78
MINIMUM GOSSIP BUS NETWORKS
Authors: FRAIGNIAUD P LAFOREST C
Citation: P. Fraigniaud et C. Laforest, MINIMUM GOSSIP BUS NETWORKS, Networks, 27(3), 1996, pp. 239-251
ANTEPENULTIMATE BROADCASTING
Authors: BERMOND JC FRAIGNIAUD P PETERS JG
Citation: Jc. Bermond et al., ANTEPENULTIMATE BROADCASTING, Networks, 26(3), 1995, pp. 125-137
METHODS AND PROBLEMS OF COMMUNICATION IN USUAL NETWORKS
Authors: FRAIGNIAUD P LAZARD E
Citation: P. Fraigniaud et E. Lazard, METHODS AND PROBLEMS OF COMMUNICATION IN USUAL NETWORKS, Discrete applied mathematics, 53(1-3), 1994, pp. 79-133
ANALYSIS OF ASYNCHRONOUS POLYNOMIAL ROOT FINDING METHODS ON A DISTRIBUTED-MEMORY MULTICOMPUTER
Authors: COSNARD M FRAIGNIAUD P
Citation: M. Cosnard et P. Fraigniaud, ANALYSIS OF ASYNCHRONOUS POLYNOMIAL ROOT FINDING METHODS ON A DISTRIBUTED-MEMORY MULTICOMPUTER, IEEE transactions on parallel and distributed systems, 5(6), 1994, pp. 639-648
BROADCASTING AND GOSSIPING IN DEBRUIJN NETWORKS
Authors: BERMOND JC FRAIGNIAUD P
Citation: Jc. Bermond et P. Fraigniaud, BROADCASTING AND GOSSIPING IN DEBRUIJN NETWORKS, SIAM journal on computing, 23(1), 1994, pp. 212-225
FINDING A TARGET SUBNETWORK IN SPARSE NETWORKS WITH RANDOM FAULTS
Authors: FRAIGNIAUD P KENYON C PELC A
Citation: P. Fraigniaud et al., FINDING A TARGET SUBNETWORK IN SPARSE NETWORKS WITH RANDOM FAULTS, Information processing letters, 48(6), 1993, pp. 297-303
Risultati: 1-14 |