 | 2012 |
|---|
| 11 |       | George Giakkoupis,
Thomas Sauerwald:
Rumor spreading and vertex expansion.
SODA 2012: 1623-1641 |
| 10 | | George Giakkoupis,
Thomas Sauerwald,
He Sun,
Philipp Woelfel:
Low Randomness Rumor Spreading via Hashing.
STACS 2012: 314-325 |
| 9 | | George Giakkoupis,
Philipp Woelfel:
A tight RMR lower bound for randomized mutual exclusion.
STOC 2012: 983-1002 |
| 2011 |
|---|
| 8 | | George Giakkoupis,
Philipp Woelfel:
On the Randomness Requirements of Rumor Spreading.
SODA 2011: 449-461 |
| 7 | | George Giakkoupis:
Tight bounds for rumor spreading in graphs of a given conductance.
STACS 2011: 57-68 |
| 6 | | George Giakkoupis,
Nicolas Schabanel:
Optimal path search in small worlds: dimension matters.
STOC 2011: 393-402 |
| 2010 |
|---|
| 5 | | Pierre Fraigniaud,
George Giakkoupis:
On the bit communication complexity of randomized rumor spreading.
SPAA 2010: 134-143 |
| 4 | | Pierre Fraigniaud,
George Giakkoupis:
On the searchability of small-world networks with arbitrary underlying structure.
STOC 2010: 389-398 |
| 2009 |
|---|
| 3 | | Pierre Fraigniaud,
George Giakkoupis:
The effect of power-law degrees on the navigability of small worlds: [extended abstract].
PODC 2009: 240-249 |
| 2007 |
|---|
| 2 | | George Giakkoupis,
Vassos Hadzilacos:
On the complexity of greedy routing in ring-based peer-to-peer networks.
PODC 2007: 99-108 |
| 2005 |
|---|
| 1 | | George Giakkoupis,
Vassos Hadzilacos:
A scheme for load balancing in heterogenous distributed hash tables.
PODC 2005: 302-311 |
Data released under the ODC-BY 1.0 license — See also our legal information page