( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximate distributed Bellman-Ford algorithms.

, , и . IEEE Trans. Commun., 42 (8): 2515-2517 (1994)

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.

Amnôn Nôy

Valérie Noyon

Alfred Noyer-Weidner

Mario Noyer-Weidner

Alexander Noyon

 

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

Pushing Dependent Data in Clients-Providers-Servers Systems., , и . Wireless Networks, 9 (5): 421-430 (2003)Minimizing Service and Operation Costs of Periodic Scheduling., , , и . Math. Oper. Res., 27 (3): 518-544 (2002)Efficient multicast search under delay and bandwidth constraints., и . Wireless Networks, 12 (6): 747-757 (2006)Efficient Mechanism Design for Competitive Carrier Selection and Rate Allocation., , , и . IEEE Trans. Vehicular Technology, 65 (12): 10222-10226 (2016)Set It and Forget It: Approximating the Set Once Strip Cover Problem., , и . Algorithmica, 79 (2): 368-386 (2017)Who, When, Where: Timeslot Assignment to Mobile Clients., , , , и . IEEE Trans. Mob. Comput., 11 (1): 73-85 (2012)The Canadian Traveller Problem., и . SODA, стр. 261-270. ACM/SIAM, (1991)Sensor Allocation in Diverse Environments., , и . DCOSS, том 6131 из Lecture Notes in Computer Science, стр. 379-392. Springer, (2010)Poster: Local Algorithms for Sensor Selection., , , и . EWSN, стр. 179-180. Junction Publishing, Canada/ ACM, (2018)Throughput maximization of real-time scheduling with batching., , , , , и . ACM Trans. Algorithms, 5 (2): 18:1-18:17 (2009)