#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2005

2018

- This year (3)
- Last 5 years (23)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- George Giakkoupis
- STACS
- 2011

We study the connection between the rate at which a rumor spreads throughout a graph and the conductance of the graphâ€”a standard measure of a graphâ€™s expansion properties. We show that for any n-nodeâ€¦ (More)

- Pierre Fraigniaud, George Giakkoupis
- PODC
- 2009

We analyze decentralized routing in small-world networks that combine a wide variation in node degrees with a notion of spatial embedding. Specifically, we consider a variation of Kleinberg'sâ€¦ (More)

- George Giakkoupis, Philipp Woelfel
- PODC
- 2012

We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic read/write registers in asynchronous shared memory models with n processes. We present an adaptiveâ€¦ (More)

- George Giakkoupis
- ArXiv
- 2016

We consider the classic Moran process modeling the spread of genetic mutations, as extended to structured populations by Lieberman et al. (Nature, 2005). In this process, individuals are the verticesâ€¦ (More)

- Pierre Fraigniaud, George Giakkoupis
- STOC
- 2010

Revisiting the "small-world" experiments of the '60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two people, and he proposed aâ€¦ (More)

- George Giakkoupis
- SODA
- 2014

We establish a bound for the classic PUSH-PULL rumor spreading protocol on arbitrary graphs, in terms of the vertex expansion of the graph. We show that O(log(n)/Î±) rounds suffice with highâ€¦ (More)

- George Giakkoupis, Vassos Hadzilacos
- PODC
- 2005

We present a scheme for evenly partitioning the key space in distributed hash tables among the participating nodes. The scheme is based on the multiple random choices paradigm [3, 19], and handlesâ€¦ (More)

- George Giakkoupis, Vassos Hadzilacos
- PODC
- 2007

We investigate the complexity of greedy routing in <i>uniform ring-based random graphs</i>, a general model that captures many topologies that have been proposed for peer-to-peer and social networks.â€¦ (More)

We present RIPOSTE, a distributed algorithm for disseminating information (ideas, news, opinions, or trends) in a social network. RIPOSTE ensures that information spreads widely if and only if aâ€¦ (More)

- Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
- PODC
- 2013

Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problemâ€¦ (More)