( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Performance of One-Round Walks in Linear Congestion Games.

, , , и . Theory Comput. Syst., 49 (1): 24-45 (2011)

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.

Michele Luminati

Michele Albertini

Michèle Mattusch

Michele Cagnoli

Michele Susca

 

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

On Minimizing the Number of ADMs in a General Topology Optical Network., , и . DISC, том 4167 из Lecture Notes in Computer Science, стр. 459-473. Springer, (2006)A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load., , и . Parallel Process. Lett., 8 (2): 207-220 (1998)On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles., , и . SIROCCO, том 17 из Proceedings in Informatics, стр. 133-145. Carleton Scientific, (2003)Learning DNF Formulae Under Classes of Probability Distributions., , и . COLT, стр. 85-92. ACM, (1992)Deadlock-Free Interval Routing Schemes.. STACS, том 1200 из Lecture Notes in Computer Science, стр. 351-362. Springer, (1997)Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves., , , и . MFCS, том 4162 из Lecture Notes in Computer Science, стр. 363-374. Springer, (2006)When ignorance helps: Graphical multicast cost sharing games., , , и . Theor. Comput. Sci., 411 (3): 660-671 (2010)On routing of wavebands for all-to-all communications in all-optical paths and cycles., , и . Theor. Comput. Sci., 333 (3): 401-413 (2005)Minimizing total busy time in parallel scheduling with application to optical networks., , , , , , и . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)Optimizing regenerator cost in traffic grooming., , , , и . Theor. Comput. Sci., 412 (52): 7109-7121 (2011)