PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Giakkoupis, George"

Author of the publication

copydeleteadd this publication to your clipboard
Lightweight Privacy-Preserving Averaging for the Internet of Things.

, , , and . M4IoT@Middleware, page 19-22. ACM, (2016)

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.

George Basem Fouad Eskandar University of Stuttgart

 

Other publications of authors with the same name

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM., and . FOCS, page 504-513. IEEE Computer Society, (2014)Bounds on the Voter Model in Dynamic Networks., , , and . ICALP, volume 55 of LIPIcs, page 146:1-146:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Gossip Protocols for Renaming and Sorting., , and . DISC, volume 8205 of Lecture Notes in Computer Science, page 194-208. Springer, (2013)A scheme for load balancing in heterogenous distributed hash tables., and . PODC, page 302-311. ACM, (2005)Greedy routing in small-world networks with power-law degrees., and . Distributed Computing, 27 (4): 231-253 (2014)Tight Bounds on Vertex Connectivity Under Vertex Sampling., , , , and . SODA, page 2006-2018. SIAM, (2015)Randomized Rumor Spreading in Dynamic Graphs., , and . ICALP (2), volume 8573 of Lecture Notes in Computer Science, page 495-507. Springer, (2014)Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time., , , and . ICALP, volume 55 of LIPIcs, page 136:1-136:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)A tight RMR lower bound for randomized mutual exclusion., and . STOC, page 983-1002. ACM, (2012)Optimal path search in small worlds: dimension matters., and . STOC, page 393-402. ACM, (2011)