ROLE
BOOKMARK & SHARE


1
January 2018
SODA '18: Proceedings of the TwentyNinth Annual ACMSIAM 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 CoalescingBranching 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 cachecoherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlockfree. 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 λedgeconnected 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 ContextAware Applications in the IoT
Publisher: ACM
The number of connected devices is growing continuously, and so is their presence into our everyday lives. From GPSenabled fitness trackers, to smart fridges that tell us what we need to buy at the grocery store, connected devicesthingshave the potential to collect and make available significant amounts of information. On ...
Keywords:
PrivacyPreserving, 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 (pushpull) 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: SpringerVerlag New York, Inc.
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 "privacyconscious" manner, namely without revealing the opinion of ...
7
June 2015
STOC '15: Proceedings of the fortyseventh 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 testandset 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 oneshot testandset object in the standard asynchronous shared memory model with n processes. The best lower bound is log n  1 ...
Keywords:
shared memory model, obstructionfree, space complexity, testandset algorithm
8
January 2015
SODA '15: Proceedings of the twentysixth annual ACMSIAM 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 λedgeconnected 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
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: SpringerVerlag
In this paper we study decentralized routing in smallworld networks that combine a wide variation in node degrees with a notion of spatial embedding. Specifically, we consider a variant of J. Kleinberg's gridbased smallworld model in which (1) the number of longrange edges of each node is not fixed, but ...
Keywords:
Small worlds, Social networks, Powerlaw degrees, Routing, Search
11
January 2014
SODA '14: Proceedings of the twentyfifth annual ACMSIAM 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 PUSHPULL 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: SpringerVerlag New York, Inc.
We present a deterministic obstructionfree implementation of leader election from <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$O\sqrt n$</EquationSource> </InlineEquation> 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 obstructionfree algorithm, in which any process can finish if ...
Keywords:
obstructionfree algorithms, randomized algorithms, leader election, testandset, shared memory model
13
October 2013
DISC 2013: Proceedings of the 27th International Symposium on Distributed Computing  Volume 8205
Publisher: SpringerVerlag New York, Inc.
We devise efficient gossipbased protocols for some fundamental distributed tasks. The protocols assume an n node network supporting pointtopoint 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 TestAndSet (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, testandset, strong/weak adversary, time/space complexity
17
May 2012
STOC '12: Proceedings of the fortyfourth 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 twentythird annual ACMSIAM 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 fortythird 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 smallworld model (2000). This model is based on a ddimensional grid graph of n nodes, augmented by a constant number of "longrange 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, peertopeer networks, decentralized search, social networks
20
January 2011
SODA '11: Proceedings of the twentysecond annual ACMSIAM 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 ...

