George Giakkoupis
Bibliometrics: publication history
 Average citations per article 4.08 Citation Count 106 Publication count 26 Publication years 2005-2018 Available for download 18 Average downloads per article 193.00 Downloads (cumulative) 3,474 Downloads (12 Months) 403 Downloads (6 Weeks) 49
SEARCH
ROLE
Author only
· Other only
· All roles

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 26 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 26 Result page: 1 2 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 5,   Downloads (12 Months): 5,   Downloads (Overall): 5 Full text available: PDF A Coalescing-Branching Random Walk (C o B ra ) is a natural extension to the standard random walk on a graph. The process starts with one pebble at an arbitrary node. In each round of the process every pebble splits into k pebbles, which are sent to k random neighbors. ... 2 July 2017 PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 13,   Downloads (12 Months): 47,   Downloads (Overall): 47 Full text available: PDF We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(\log n/\log\log n) RMR complexity. Keywords: rmr complexity, shared memory, mutual exclusion, oblivious adversary, cc model 3 May 2017 ACM Transactions on Algorithms (TALG) - Special Issue on SODA'15 and Regular Papers: Volume 13 Issue 2, May 2017 Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 5,   Downloads (12 Months): 73,   Downloads (Overall): 73 Full text available: PDF A fundamental result by Karger [10] states that for any λ-edge-connected graph with n nodes, independently sampling each edge with probability p = Ω(log ( n )/λ) results in a graph that has edge connectivity Ω(λ p ), with high probability. This article proves the analogous result for vertex connectivity, ... Keywords: Vertex connectivity, graph sampling 4 December 2016 M4IoT 2016: Proceedings of the 3rd Workshop on Middleware for Context-Aware Applications in the IoT Publisher: ACM Bibliometrics: Citation Count: 0 The number of connected devices is growing continuously, and so is their presence into our everyday lives. From GPS-enabled fitness trackers, to smart fridges that tell us what we need to buy at the grocery store, connected devices---things---have the potential to collect and make available significant amounts of information. On ... Keywords: Privacy-Preserving, IoT, aggregation 5 July 2016 PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 4,   Downloads (12 Months): 66,   Downloads (Overall): 109 Full text available: PDF In standard randomized (push-pull) rumor spreading, nodes communicate in synchronized rounds. In each round every node contacts a random neighbor in order to exchange the rumor (i.e., either push the rumor to its neighbor or pull it from the neighbor). A natural asynchronous variant of this algorithm is one where ... Keywords: asynchronous vs synchronous models, randomized rumor spreading, push/pull 6 October 2015 DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 0 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 large fraction of users find it interesting, and this is done in a "privacy-conscious" manner, namely without revealing the opinion of ... 7 June 2015 STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of computing Publisher: ACM Bibliometrics: Citation Count: 3 Downloads (6 Weeks): 3,   Downloads (12 Months): 17,   Downloads (Overall): 142 Full text available: PDF The test-and-set object is a fundamental synchronization primitive for shared memory systems. This paper addresses the number of registers (supporting atomic reads and writes) required to implement a one-shot test-and-set object in the standard asynchronous shared memory model with n processes. The best lower bound is log n - 1 ... Keywords: shared memory model, obstruction-free, space complexity, test-and-set algorithm 8 January 2015 SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 2 Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 43 Full text available: PDF A fundamental result by Karger [10] states that for any λ-edge-connected graph with n nodes, independently sampling each edge with probability p = Ω(log n /λ) results in a graph that has edge connectivity Ω(λ p ), with high probability. This paper proves the analogous result for vertex connectivity, when ... 9 October 2014 FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science Publisher: IEEE Computer Society Bibliometrics: Citation Count: 1 In this paper we settle an open question by determining the remote memory reference (RMR) complexity of randomized mutual exclusion, on the distributed shared memory model (DSM) with atomic registers, in a weak but natural (and stronger than oblivious) adversary model. In particular, we present a mutual exclusion algorithm that ... Keywords: mutual exclusion, RMR complexity, shared memory, oblivious adversary, DSM 10 August 2014 Distributed Computing: Volume 27 Issue 4, August 2014 Publisher: Springer-Verlag Bibliometrics: Citation Count: 0 In this paper we study decentralized routing in small-world networks that combine a wide variation in node degrees with a notion of spatial embedding. Specifically, we consider a variant of J. Kleinberg's grid-based small-world model in which (1) the number of long-range edges of each node is not fixed, but ... Keywords: Small worlds, Social networks, Power-law degrees, Routing, Search 11 January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 7 Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Downloads (Overall): 65 Full text available: PDF We establish a bound for the classic PUSH-PULL rumor spreading protocol on general graphs, in terms of the vertex expansion of the graph. We show that O (log 2 ( n )/ α ) rounds suffice with high probability to spread a rumor from any single node to all n ... 12 October 2013 DISC 2013: Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 4 We present a deterministic obstruction-free implementation of leader election from $O\sqrt n$ atomic O log n -bit registers in the standard asynchronous shared memory system with n processes. We provide also a technique to transform any deterministic obstruction-free algorithm, in which any process can finish if ... Keywords: obstruction-free algorithms, randomized algorithms, leader election, test-and-set, shared memory model 13 October 2013 DISC 2013: Proceedings of the 27th International Symposium on Distributed Computing - Volume 8205 Publisher: Springer-Verlag New York, Inc. Bibliometrics: Citation Count: 1 We devise efficient gossip-based protocols for some fundamental distributed tasks. The protocols assume an n -node network supporting point-to-point communication, and in every round, each node exchanges information of size O log n bits with at most one other node. We first consider the renaming problem, that is, to assign ... Keywords: epidemic protocols, gossip protocols, renaming, sorting, network algorithms, randomized algorithms, distributed algorithms 14 July 2013 PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Downloads (Overall): 151 Full text available: PDF 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 when the namespace is linear in the number of participants, a variant known as loose renaming. We give ... Keywords: lower bounds, renaming, distributed computing, shared memory, upper bounds 15 July 2012 PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing Publisher: ACM Bibliometrics: Citation Count: 0 Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Downloads (Overall): 62 Full text available: PDF The Cache Coherent (CC) and the Distributed Shared Memory (DSM) models are standard shared memory models, and the Remote Memory Reference (RMR) complexity is considered to accurately predict the actual performance of mutual exclusion algorithms in shared memory systems. In [12] we prove a tight lower bound for the RMR ... Keywords: mutual exclusion, randomization, strong adversary, lower bound, remote memory references, rmrs 16 July 2012 PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing Publisher: ACM Bibliometrics: Citation Count: 9 Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Downloads (Overall): 205 Full text available: PDF 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 TAS algorithm with an expected (individual) step complexity of O (log * k ), for contention k , against the oblivious adversary, ... Keywords: randomization, leader election, shared memory, test-and-set, strong/weak adversary, time/space complexity 17 May 2012 STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing Publisher: ACM Bibliometrics: Citation Count: 7 Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Downloads (Overall): 212 Full text available: PDF The Cache Coherent (CC) and the Distributed Shared Memory (DSM) models are standard shared memory models, and the Remote Memory Reference (RMR) complexity is considered to accurately predict the actual performance of mutual exclusion algorithms in shared memory systems. In this paper we prove a tight lower bound for the ... Keywords: mutual exclusion, RMRs, randomization, strong adversary, lower bound, remote memory references 18 January 2012 SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 14 Downloads (6 Weeks): 2,   Downloads (12 Months): 9,   Downloads (Overall): 222 Full text available: PDF We study the relation between the rate at which rumors spread throughout a graph and the vertex expansion of the graph. We consider the standard rumor spreading protocol where every node chooses a random neighbor in each round and the two nodes exchange the rumors they know. For any n ... 19 June 2011 STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing Publisher: ACM Bibliometrics: Citation Count: 3 Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 399 Full text available: PDF We consider Kleinberg's celebrated small-world model (2000). This model is based on a d-dimensional grid graph of n nodes, augmented by a constant number of "long-range links" per node. It is known that this graph has diameter O(log n), and that a simple greedy search algorithm visits an expected number ... Keywords: small worlds, optimal paths, peer-to-peer networks, decentralized search, social networks 20 January 2011 SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms Publisher: Society for Industrial and Applied Mathematics Bibliometrics: Citation Count: 8 Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 94 Full text available: PDF We investigate the randomness requirements of the classical rumor spreading problem on fully connected graphs with n vertices. In the standard random protocol, where each node that knows the rumor sends it to a randomly chosen neighbor in every round, each node needs O ((log n ) 2 ) random ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.