Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- invited-talkJuly 2016
How Emerging Memory Technologies Will Have You Rethinking Algorithm Design
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPage 303https://doi.org/10.1145/2933057.2933124We are on the cusp of the emergence of a new wave of nonvolatile memory technologies that are projected to become the dominant type of main memory in the near future. A key property of these new memory technologies is their asymmetric read-write costs: ...
- research-articleJuly 2016
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 107–116https://doi.org/10.1145/2933057.2933120The set consensus problem has played an important role in the study of distributed systems for over two decades. Indeed, the search for lower bounds and impossibility results for this problem spawned the topological approach to distributed computing, ...
- research-articleJuly 2016
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 461–467https://doi.org/10.1145/2933057.2933119Information propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a random ...
- research-articleJuly 2016
How Asynchrony Affects Rumor Spreading Time
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 185–194https://doi.org/10.1145/2933057.2933117In 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). ...
- research-articleJuly 2016Best Student Paper
The Greedy Spanner is Existentially Optimal
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 9–17https://doi.org/10.1145/2933057.2933114The greedy spanner is arguably the simplest and most well-studied spanner construction. Experimental results demonstrate that it is at least as good as any other spanner construction, in terms of both the size and weight parameters. However, a rigorous ...
-
- research-articleJuly 2016
A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 289–298https://doi.org/10.1145/2933057.2933113For many years, Herlihy's elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this ...
- research-articleJuly 2016
An Algorithm for Replicated Objects with Efficient Reads
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 325–334https://doi.org/10.1145/2933057.2933111The problem. We consider the problem of implementing a consistent replicated object in a partially synchronous message passing distributed system susceptible to process and communication failures. The object is a generic shared resource, such as a data ...
- research-articleJuly 2016
Contention Resolution on Multiple Channels with Collision Detection
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 175–184https://doi.org/10.1145/2933057.2933110In this paper, we consider the classical contention resolution problem in which an unknown subset of n possible nodes are activated and connected to a shared channel. The problem is solved in the first round that an active node transmits alone (thus ...
- research-articleJuly 2016
Distributed Algorithms for Planar Networks I: Planar Embedding
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 29–38https://doi.org/10.1145/2933057.2933109This paper presents the first (non-trivial) distributed planar embedding algorithm. We consider this a crucial first step in a broader program to design efficient distributed algorithms for planar networks. We work in the standard distributed model in ...
- research-articleJuly 2016
A Randomized Concurrent Algorithm for Disjoint Set Union
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 75–82https://doi.org/10.1145/2933057.2933108Disjoint set union is a basic problem in data structures with a wide variety of applications. We extend a known efficient sequential algorithm for this problem to obtain a simple and efficient concurrent wait-free algorithm running on an asynchronous ...
- research-articleJuly 2016
Ant-Inspired Density Estimation via Random Walks: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 469–478https://doi.org/10.1145/2933057.2933106Many ant species employ distributed population density estimation in applications ranging from quorum sensing [21], to task allocation [9], to appraisal of enemy colony strength [1]. It has been shown that ants estimate density by tracking encounter ...
- research-articleJuly 2016
How Proofs are Prepared at Camelot: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 391–400https://doi.org/10.1145/2933057.2933101We study a design framework for robust, independently verifiable, and workload-balanced distributed algorithms working on a common input. The framework builds on recent noninteractive Merlin--Arthur proofs of batch evaluation of Williams~[31st IEEE ...
- research-articleJuly 2016
On the Complexity of Reader-Writer Locks: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 315–324https://doi.org/10.1145/2933057.2933099A reader-writer lock [7] is a widely-used variant of the mutual exclusion lock abstraction [10]. It is shared by $n$ readers and m writers, whose accesses of the Critical Section (CS) must satisfy the following requirement: reader processes are allowed ...
- research-articleJuly 2016Best Paper
Analysing Snapshot Isolation
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 55–64https://doi.org/10.1145/2933057.2933096Snapshot isolation (SI) is a widely used consistency model for transaction processing, implemented by most major databases and some of transactional memory systems. Unfortunately, its classical definition is given in a low-level operational way, by an ...
- research-articleJuly 2016
Distributed Strong Diameter Network Decomposition: Extended Abstract
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 211–216https://doi.org/10.1145/2933057.2933094For a pair of positive parameters D,Χ, a partition P of the vertex set V of an n-vertex graph G = (V,E) into disjoint clusters of diameter at most D each is called a (D,Χ) network decomposition}, if the supergraph G(P), obtained by contracting each of ...
- research-articleJuly 2016
Noisy Rumor Spreading and Plurality Consensus
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 127–136https://doi.org/10.1145/2933057.2933089Error-correcting codes are efficient methods for handling noisy communication channels in the context of technological networks. However, such elaborate methods differ a lot from the unsophisticated way biological entities are supposed to communicate. ...
- research-articleJuly 2016Best Student Paper
A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 3–8https://doi.org/10.1145/2933057.2933086We present a simple deterministic distributed (2+ε) approximation algorithm for minimum weight vertex cover, which completes in O(logδ/εlog logδ) rounds, where δ is the maximum degree in the graph, for any ε > 0 which is at most O(1). For a constant ε, ...
- research-articleJuly 2016
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 227–233https://doi.org/10.1145/2933057.2933084The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on ...
- announcementJuly 2016
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 195–197https://doi.org/10.1145/2933057.2933079Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
- announcementJuly 2016
Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingPages 47–49https://doi.org/10.1145/2933057.2933076We present optimal randomized leader election algorithms for multi-hop radio networks, which run in expected time asymptotically equal to that required to broadcast one message to the network. We first observe that, under certain assumptions, a ...