( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation algorithms for routing and call scheduling in all-optical chains and rings.

, , и . Theor. Comput. Sci., 287 (2): 429-448 (2002)

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.

Alen Ianni

Sara Ianni

Inge Ianniello

Remo Ianniello

Angela Alexandra Ingrid Ianni

 

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

Efficient Delay Routing (Extended Abstract).. Euro-Par, Vol. I, том 1123 из Lecture Notes in Computer Science, стр. 258-269. Springer, (1996)Wormhole Deadlock Prediction.. Euro-Par, том 1300 из Lecture Notes in Computer Science, стр. 188-195. Springer, (1997)MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks., , , , и . SimuTools, стр. 38. ICST/ACM, (2008)Wormhole Deadlock Prediction.. Parallel Process. Lett., 10 (4): 295-304 (2000)Minimum Length Scheduling of Precedence Constrained Messages in Distributed Systems (Extended Abstract)., , и . Euro-Par, Vol. II, том 1124 из Lecture Notes in Computer Science, стр. 594-601. Springer, (1996)Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees., и . Euro-Par, том 1470 из Lecture Notes in Computer Science, стр. 1029-1039. Springer, (1998)Smooth movement and Manhattan path based Random Waypoint mobility., , , , , и . Inf. Process. Lett., 111 (5): 239-246 (2011)Complexity of Scorpion Solitaire and applications to Klondike., и . ICTCS, том 2756 из CEUR Workshop Proceedings, стр. 172-183. CEUR-WS.org, (2020)Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings., , , , и . WG, том 5344 из Lecture Notes in Computer Science, стр. 90-100. (2008)Distributed Community Detection in Dynamic Graphs - (Extended Abstract)., , , , и . SIROCCO, том 8179 из Lecture Notes in Computer Science, стр. 1-12. Springer, (2013)