( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Repair Time in Distributed Storage Systems.

, , , , и . Globe, том 8059 из Lecture Notes in Computer Science, стр. 99-110. Springer, (2013)

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 Müller

Stéphane Klein

Stéphane Haussler

Stéphane Clinchant

Stéphane Aubry

 

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

Hardness and Approximation of Traffic Grooming., , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 561-573. Springer, (2007)Study of a Combinatorial Game in Graphs Through Linear Programming., , , и . Algorithmica, 82 (2): 212-244 (2020)Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter., , , , и . COMPLEX NETWORKS (2), том 944 из Studies in Computational Intelligence, стр. 597-609. Springer, (2020)Hardness and approximation of Gathering in static radio networks., , , , и . PerCom Workshops, стр. 75-79. IEEE Computer Society, (2006)Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols., и . SIAM J. Discret. Math., 17 (4): 521-540 (2004)On the Hardness of Equal Shortest Path Routing., , и . Electron. Notes Discret. Math., (2013)Sequential Metric Dimension., , , , и . WAOA, том 11312 из Lecture Notes in Computer Science, стр. 36-50. Springer, (2018)Designing Hypergraph Layouts to GMPLS Routing Strategies., , , , , и . SIROCCO, том 5869 из Lecture Notes in Computer Science, стр. 57-71. Springer, (2009)Biased Majority Opinion Dynamics: Exploiting Graph k-domination., , и . IJCAI, стр. 377-383. ijcai.org, (2022)Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair, , , и . 11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL 2009), Carry Le Rouet, France, (Juin 2009)