( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Determining majority in networks with local interactions and very small local memory.

, , , and . Distributed Comput., 30 (1): 1-16 (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. You can also use the button next to the name to display some publications already assigned to the person.

Paul-G Behler

Paul G Lankisch

Paul G Lankisch

Giuseppe G G Manzardo

G Lüers

 

Other publications of authors with the same name

Scheduling tasks with dependencies on asymmetric multiprocessors., , and . PODC, page 454. ACM, (2008)Multiplayer pervasive games and networked interactive installations using ad hoc mobile sensor networks., , , , , , and . Advances in Computer Entertainment Technology, volume 422 of ACM International Conference Proceeding Series, page 453. ACM, (2009)Efficient Computations on Fault-Prone BSP Machines., , and . SPAA, page 84-93. ACM, (1997)Fundamental Control Algorithms in Mobile Networks., , , , and . SPAA, page 251-260. ACM, (1999)Weighted random sampling with a reservoir., and . Inf. Process. Lett., 97 (5): 181-185 (2006)A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks., , , and . Ad Hoc Networks, 4 (5): 621-635 (2006)The Match-Maker: Constant-Space Distributed Majority via Random Walks., , , and . SSS, volume 9212 of Lecture Notes in Computer Science, page 67-80. Springer, (2015)Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays., , and . SPAA, page 254-264. ACM, (1989)Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)., and . Euro-Par, volume 1900 of Lecture Notes in Computer Science, page 456-460. Springer, (2000)The Diameter of Connected Components of Random Graphs.. WG, volume 246 of Lecture Notes in Computer Science, page 264-276. Springer, (1986)