( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Broadcasting in Hypercubes in the Circuit Switched Model.

, , , , и . IPDPS, стр. 21-26. IEEE Computer Society, (2000)

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.

Jean-Claude Heilig

Jean-Claude Jaquet

Jean-Claude Nkurikiyinka

Jean-Claude Eischen

Jean-Claude Fernandez

 

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

Girth in digraphs., , , и . J. Graph Theory, 4 (3): 337-341 (1980)Broadcasting in Hypercubes in the Circuit Switched Model., , , , и . IPDPS, стр. 21-26. IEEE Computer Society, (2000)Hardness and approximation of Gathering in static radio networks., , , , и . PerCom Workshops, стр. 75-79. IEEE Computer Society, (2006)The α-Arboricity of Complete Uniform Hypergraphs., , , и . SIAM J. Discret. Math., 25 (2): 600-610 (2011)Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences., и . ADHOC-NOW, том 5198 из Lecture Notes in Computer Science, стр. 204-217. Springer, (2008)Hardness and Approximation of Gathering in Static Radio Networks., , , , и . Parallel Process. Lett., 16 (2): 165-184 (2006)Efficient Broadcasting Protocols on the de Bruijn and Similar Networks., и . SIROCCO, том 2 из Proceedings in Informatics, стр. 199-209. Carleton Scientific, (1995)A note on cycle covering., , , и . SPAA, стр. 310-311. ACM, (2001)Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions., , и . SIROCCO, том 4474 из Lecture Notes in Computer Science, стр. 261-273. Springer, (2007)Line graphs of hypergraphs I., , и . Discret. Math., 18 (3): 235-241 (1977)