( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.

, , , и . IEEE Trans. Parallel Distributed Syst., 28 (3): 689-703 (2017)

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.

Iain P A Stitt

Iain Mann

Iain McGinniss

Iain McGregor

Iain Parris

 

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

Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori.. IEEE Trans. Computers, 63 (10): 2473-2486 (2014)A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness., и . WG, том 2204 из Lecture Notes in Computer Science, стр. 306-316. Springer, (2001)Improved routing algorithms in the dual-port datacenter networks HCN and BCN., , , и . Future Gener. Comput. Syst., (2017)Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws.. CSL, том 1683 из Lecture Notes in Computer Science, стр. 374-388. Springer, (1999)Frameworks for Logically Classifying Polynomial-Time Optimisation Problems., и . CSR, том 6072 из Lecture Notes in Computer Science, стр. 120-131. Springer, (2010)Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes.. COCOA, том 6831 из Lecture Notes in Computer Science, стр. 82-97. Springer, (2011)Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs.. WG, том 570 из Lecture Notes in Computer Science, стр. 198-208. Springer, (1991)On Routing Algorithms for the DPillar Data Centre Networks., , и . ICA3PP (4), том 9531 из Lecture Notes in Computer Science, стр. 329-343. Springer, (2015)Generalized Hex and Logical Characterizations of Polynomial Space., и . Inf. Process. Lett., 63 (3): 147-152 (1997)Distributed Algorithms for Building Hamiltonian Cycles in k-ary n-cubes and Hypercubes with Faulty Links.. ICPADS (1), стр. 308-318. IEEE Computer Society, (2006)