( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
MaxMin Fair Flow Control Sensitive to Priorities.

, , и . OPODIS, стр. 45-60. Hermes, (1998)

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.

Marios Strapatsakis

Marios Psychogios

Marios Papakyriacou

Marios Paulides

Marios Kakoullis

 

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

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control., , и . SIAM J. Comput., 34 (5): 1216-1252 (2005)Optimal, Distributed Decision-Making: The Case of No Communication., , и . FCT, том 1684 из Lecture Notes in Computer Science, стр. 293-303. Springer, (1999)A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks., , , , и . Euro-Par, том 2790 из Lecture Notes in Computer Science, стр. 1003-1016. Springer, (2003)Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract)., , и . PODC, стр. 139-148. ACM, (1997)An upper and a lower bound for tick synchronization.. RTSS, стр. 246-255. IEEE Computer Society, (1992)The Impact of Network Structure on the Stability of Greedy Protocols., , , и . CIAC, том 2653 из Lecture Notes in Computer Science, стр. 251-263. Springer, (2003)MaxMin Fair Flow Control Sensitive to Priorities., , и . OPODIS, стр. 45-60. Hermes, (1998)Threshold Counters with Increments and Decrements., , , и . SIROCCO, стр. 47-61. Carleton Scientific, (1999)A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane, , и . CoRR, (2012)The Price of Anarchy for Polynomial Social Cost., , , и . Computing and Markets, том 05011 из Dagstuhl Seminar Proceedings, IBFI, Schloss Dagstuhl, Germany, (2005)