( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Information Dissemination in Star and Pancake Networks.

, , и . SPDP, стр. 720-725. IEEE Computer Society, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Stéphane Klein

Stéphane Müller

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

Другие публикации лиц с тем же именем

Study of a Combinatorial Game in Graphs Through Linear Programming., , , и . Algorithmica, 82 (2): 212-244 (2020)Hardness and Approximation of Gathering in Static Radio Networks., , , , и . Parallel Process. Lett., 16 (2): 165-184 (2006)Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks., , , , , , , , , и . CloudNet, стр. 1-6. IEEE, (2019)Efficient communication in unknown networks., , , и . Networks, 38 (1): 39-49 (2001)Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter., , , , и . COMPLEX NETWORKS (2), том 944 из Studies in Computational Intelligence, стр. 597-609. Springer, (2020)A Gossip Algorithm for Bus Networks with Buses of Limited Length., , и . Euro-Par, Vol. I, том 1123 из Lecture Notes in Computer Science, стр. 353-360. Springer, (1996)Hardness and Approximation of Traffic Grooming., , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 561-573. Springer, (2007)Hardness and approximation of Gathering in static radio networks., , , , и . PerCom Workshops, стр. 75-79. IEEE Computer Society, (2006)Broadcasting in Hypercubes in the Circuit Switched Model., , , , и . IPDPS, стр. 21-26. IEEE Computer Society, (2000)Efficient Communication in Unknown Networks., , , и . WG, том 1928 из Lecture Notes in Computer Science, стр. 172-183. Springer, (2000)