default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge Giakkoupis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]George Giakkoupis, Volker Turau
, Isabella Ziccardi:
Luby's MIS algorithms made self-stabilizing. Inf. Process. Lett. 188: 106531 (2025)- 2024
- [c44]George Giakkoupis, Marcos Kiwi, Dimitrios Los:
Naively Sorting Evolving Data is Optimal and Robust. FOCS 2024: 2217-2242 - [c43]George Giakkoupis, Volker Turau, Isabella Ziccardi:
Brief Announcement: Self-Stabilizing MIS Computation in the Beeping Model. PODC 2024: 87-90 - [c42]Dante Bencivenga, George Giakkoupis, Philipp Woelfel:
Faster Randomized Repeated Choice and DCAS. PODC 2024: 454-464 - [c41]George Giakkoupis, Volker Turau, Isabella Ziccardi:
Self-Stabilizing MIS Computation in the Beeping Model. DISC 2024: 28:1-28:21 - [i11]George Giakkoupis, Marcos Kiwi, Dimitrios Los:
Naively Sorting Evolving Data is Optimal and Robust. CoRR abs/2404.08162 (2024) - [i10]George Giakkoupis, Volker Turau, Isabella Ziccardi:
Self-Stabilizing MIS Computation in the Beeping Model. CoRR abs/2405.04266 (2024) - 2023
- [c40]David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel:
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC 2023: 79-89 - [c39]George Giakkoupis, Isabella Ziccardi:
Distributed Self-Stabilizing MIS with Few States and Weak Communication. PODC 2023: 310-320 - [i9]George Giakkoupis, Isabella Ziccardi:
Distributed Self-Stabilizing MIS with Few States and Weak Communication. CoRR abs/2301.05059 (2023) - 2022
- [c38]George Giakkoupis:
Expanders via local edge flips in quasilinear time. STOC 2022: 64-76 - 2021
- [c37]George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Cluster-and-Conquer: When Randomness Meets Graph Locality. ICDE 2021: 2027-2032 - [c36]Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
Search via Parallel Lévy Walks on Z2. PODC 2021: 81-91 - [c35]Paul Bastide, George Giakkoupis, Hayk Saribekyan:
Self-Stabilizing Clock Synchronization with 1-bit Messages. SODA 2021: 2154-2173 - [c34]George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel:
Efficient randomized DCAS. STOC 2021: 1221-1234 - 2020
- [c33]Petra Berenbrink, George Giakkoupis, Peter Kling:
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. PODC 2020: 218-220 - [c32]Petra Berenbrink, George Giakkoupis, Peter Kling:
Optimal time and space leader election in population protocols. STOC 2020: 119-129 - [c31]George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald:
Spread of Information and Diseases via Random Walks in Sparse Graphs. DISC 2020: 9:1-9:17 - [i8]Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
On the Search Efficiency of Parallel Lévy Walks on Z2. CoRR abs/2004.01562 (2020) - [i7]George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan:
How to Spread a Rumor: Call Your Neighbors or Take a Walk? CoRR abs/2006.02368 (2020) - [i6]George Giakkoupis, Anne-Marie Kermarrec, Olivier Ruas, François Taïani:
Cluster-and-Conquer: When Randomness Meets Graph Locality. CoRR abs/2010.11497 (2020)
2010 – 2019
- 2019
- [j4]George Giakkoupis, Philipp Woelfel:
Efficient randomized test-and-set implementations. Distributed Comput. 32(6): 565-586 (2019) - [c30]George Giakkoupis, Frederik Mallmann-Trenn, Hayk Saribekyan:
How to Spread a Rumor: Call Your Neighbors or Take a Walk? PODC 2019: 24-33 - [i5]George Giakkoupis, Philipp Woelfel:
Efficient Randomized Test-And-Set Implementations. CoRR abs/1902.04002 (2019) - 2018
- [j3]Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading and Conductance. J. ACM 65(4): 17:1-17:21 (2018) - [c29]Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA 2018: 1715-1733 - [c28]George Giakkoupis, Philipp Woelfel:
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. STACS 2018: 37:1-37:13 - 2017
- [j2]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13(2): 19:1-19:26 (2017) - [c27]George Giakkoupis, Philipp Woelfel:
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. PODC 2017: 221-229 - 2016
- [c26]Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling:
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. ICALP 2016: 136:1-136:14 - [c25]Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn:
Bounds on the Voter Model in Dynamic Networks. ICALP 2016: 146:1-146:15 - [c24]Tristan Allard, Davide Frey, George Giakkoupis, Julien Lepiller:
Lightweight Privacy-Preserving Averaging for the Internet of Things. M4IoT@Middleware 2016: 19-22 - [c23]George Giakkoupis, Yasamin Nazari, Philipp Woelfel:
How Asynchrony Affects Rumor Spreading Time. PODC 2016: 185-194 - [e1]George Giakkoupis:
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016. ACM 2016, ISBN 978-1-4503-3964-3 [contents] - [i4]Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn:
Bounds on the Voter Model in Dynamic Networks. CoRR abs/1603.01895 (2016) - [i3]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR abs/1608.06033 (2016) - [i2]George Giakkoupis:
Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs. CoRR abs/1611.01585 (2016) - 2015
- [c22]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA 2015: 2006-2018 - [c21]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Test-and-Set in Optimal Space. STOC 2015: 615-623 - [c20]George Giakkoupis, Rachid Guerraoui, Arnaud Jégou, Anne-Marie Kermarrec, Nupur Mittal:
Privacy-Conscious Information Diffusion in Social Networks. DISC 2015: 480-496 - 2014
- [j1]Pierre Fraigniaud, George Giakkoupis:
Greedy routing in small-world networks with power-law degrees. Distributed Comput. 27(4): 231-253 (2014) - [c19]George Giakkoupis, Philipp Woelfel:
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. FOCS 2014: 504-513 - [c18]George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer:
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) 2014: 495-507 - [c17]George Giakkoupis:
Tight Bounds for Rumor Spreading with Vertex Expansion. SODA 2014: 801-815 - 2013
- [c16]Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel:
Randomized loose renaming in O(log log n) time. PODC 2013: 200-209 - [c15]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC 2013: 46-60 - [c14]George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel:
Gossip Protocols for Renaming and Sorting. DISC 2013: 194-208 - [i1]George Giakkoupis:
Tight Bounds for Rumor Spreading with Vertex Expansion. CoRR abs/1302.6243 (2013) - 2012
- [c13]George Giakkoupis, Philipp Woelfel:
On the time and space complexity of randomized test-and-set. PODC 2012: 19-28 - [c12]George Giakkoupis, Philipp Woelfel:
Brief announcement: a tight RMR lower bound for randomized mutual exclusion. PODC 2012: 239-240 - [c11]George Giakkoupis, Thomas Sauerwald:
Rumor spreading and vertex expansion. SODA 2012: 1623-1641 - [c10]George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel:
Low Randomness Rumor Spreading via Hashing. STACS 2012: 314-325 - [c9]George Giakkoupis, Philipp Woelfel:
A tight RMR lower bound for randomized mutual exclusion. STOC 2012: 983-1002 - 2011
- [c8]George Giakkoupis, Philipp Woelfel:
On the Randomness Requirements of Rumor Spreading. SODA 2011: 449-461 - [c7]George Giakkoupis:
Tight bounds for rumor spreading in graphs of a given conductance. STACS 2011: 57-68 - [c6]George Giakkoupis, Nicolas Schabanel:
Optimal path search in small worlds: dimension matters. STOC 2011: 393-402 - 2010
- [c5]Pierre Fraigniaud, George Giakkoupis:
On the bit communication complexity of randomized rumor spreading. SPAA 2010: 134-143 - [c4]Pierre Fraigniaud, George Giakkoupis:
On the searchability of small-world networks with arbitrary underlying structure. STOC 2010: 389-398
2000 – 2009
- 2009
- [b1]George Giakkoupis:
On Load Balancing and Routing in Peer-to-peer Systems. University of Toronto, Canada, 2009 - [c3]Pierre Fraigniaud, George Giakkoupis:
The effect of power-law degrees on the navigability of small worlds: [extended abstract]. PODC 2009: 240-249 - 2007
- [c2]George Giakkoupis, Vassos Hadzilacos:
On the complexity of greedy routing in ring-based peer-to-peer networks. PODC 2007: 99-108 - 2005
- [c1]George Giakkoupis, Vassos Hadzilacos:
A scheme for load balancing in heterogenous distributed hash tables. PODC 2005: 302-311
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
