ACM Principles of Distributed Computing, PODC 2014


Title/Authors Title Research Artifacts
[?] A research artifact is any by-product of a research project that is not directly included in the published research paper. In Computer Science research this is often source code and data sets, but it could also be media, documentation, inputs to proof assistants, shell-scripts to run experiments, etc.
Details

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

Benoît Libert, Marc Joye, Moti Yung

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

Details
Discussion Comments: 0
Verification: Authors have not verified information

The future(s) of shared data structures

Alex Kogan, Maurice Herlihy

The future(s) of shared data structures

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Danupon Nanongkai

Brief announcement: almost-tight approximation distributed algorithm for minimum cut

Details
Discussion Comments: 0
Verification: Author has not verified information

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties

Michel Raynal, Julien Stainer, Gadi Taubenfeld

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties

Details
Discussion Comments: 0
Verification: Authors have not verified information

Beyond set disjointness: the communication complexity of finding the intersection

Joshua Brody, Amit Chakrabarti, Ranganath Kondapally, David P. Woodruff, Grigory Yaroslavtsev

Beyond set disjointness: the communication complexity of finding the intersection

Details
Discussion Comments: 0
Verification: Authors have not verified information

The amortized complexity of non-blocking binary search trees

Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert

The amortized complexity of non-blocking binary search trees

Details
Discussion Comments: 0
Verification: Authors have not verified information

Anonymous networks: randomization = 2-hop coloring

Yuval Emek, Christoph Pfister, Jochen Seidel, Roger Wattenhofer

Anonymous networks: randomization = 2-hop coloring

Details
Discussion Comments: 0
Verification: Authors have not verified information

Coding theory for scalable media delivery

Michael George Luby

Coding theory for scalable media delivery

Details
Discussion Comments: 0
Verification: Author has not verified information

Brief announcement: a generic construction for nonblocking dual containers

Joseph Izraelevitz, Michael L. Scott

Brief announcement: a generic construction for nonblocking dual containers

Details
Discussion Comments: 0
Verification: Authors have not verified information

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication

Ofer Feinerman, Bernhard Haeupler, Amos Korman

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: local approximability of minimum dominating set on planar graphs

Miikka Hilke, Christoph Lenzen, Jukka Suomela

Brief announcement: local approximability of minimum dominating set on planar graphs

Details
Discussion Comments: 0
Verification: Authors have not verified information

A paradox of eventual linearizability in shared memory

Rachid Guerraoui, Eric Ruppert

A paradox of eventual linearizability in shared memory

Details
Discussion Comments: 0
Verification: Authors have not verified information

Distributed computing building blocks for rational agents

Yehuda Afek, Yehonatan Ginzberg, Shir Landau Feibish, Moshe Sulamy

Distributed computing building blocks for rational agents

Details
Discussion Comments: 0
Verification: Authors have not verified information

Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages

Achour Mostéfaoui, Moumen Hamouma, Michel Raynal

Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages

Details
Discussion Comments: 0
Verification: Authors have not verified information

Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Yuda Zhao, Haifeng Yu, Binbin Chen

Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

Details
Discussion Comments: 0
Verification: Authors have not verified information

Concurrent updates with RCU: search tree as an example

Maya Arbel, Hagit Attiya

Concurrent updates with RCU: search tree as an example

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: towards security and privacy for outsourced data in the multi-party setting

Matteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schröder

Brief announcement: towards security and privacy for outsourced data in the multi-party setting

Details
Discussion Comments: 0
Verification: Authors have not verified information

Rational and resilient protocols

Silvio Micali

Rational and resilient protocols

Details
Discussion Comments: 0
Verification: Author has not verified information

Distributing the setup in universally composable multi-party computation

Jonathan Katz, Aggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas

Distributing the setup in universally composable multi-party computation

Details
Discussion Comments: 0
Verification: Authors have not verified information

Trade-offs between selection complexity and performance when searching the plane without communication

Christoph Lenzen, Nancy A. Lynch, Calvin C. Newport, Tsvetomira Radeva

Trade-offs between selection complexity and performance when searching the plane without communication

Details
Discussion Comments: 0
Verification: Authors have not verified information

Estimation for monotone sampling: competitiveness and customization

Edith Cohen

Estimation for monotone sampling: competitiveness and customization

Details
Discussion Comments: 0
Verification: Author has not verified information

Multi-message broadcast with abstract MAC layers and unreliable links

Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport

Multi-message broadcast with abstract MAC layers and unreliable links

Details
Discussion Comments: 0
Verification: Authors have not verified information

Making objects writable

Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel

Making objects writable

Details
Discussion Comments: 0
Verification: Authors have not verified information

Distributed algorithms for the Lovász local lemma and graph coloring

Kai-Min Chung, Seth Pettie, Hsin-Hao Su

Distributed algorithms for the Lovász local lemma and graph coloring

Details
Discussion Comments: 0
Verification: Authors have not verified information

Simple and efficient local codes for distributed stable network construction

Othon Michail, Paul G. Spirakis

Simple and efficient local codes for distributed stable network construction

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks

Messaoud Doudou, José M. Barceló-Ordinas, Djamel Djenouri, Jorge García-Vidal, Nadjib Badache

Brief announcement: game theoretical approach for energy-delay balancing in distributed duty-cycled MAC protocols of wireless networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Beyond geometry: towards fully realistic wireless models

Marijke H. L. Bodlaender, Magnús M. Halldórsson

Beyond geometry: towards fully realistic wireless models

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: are lock-free concurrent algorithms practically wait-free?

Dan Alistarh, Keren Censor-Hillel, Nir Shavit

Brief announcement: are lock-free concurrent algorithms practically wait-free?

Details
Discussion Comments: 0
Verification: Authors have not verified information

Complexity tradeoffs for read and update operations

Danny Hendler, Vitaly Khait

Complexity tradeoffs for read and update operations

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: linial's lower bound made easy

Juhana Laurinharju, Jukka Suomela

Brief announcement: linial's lower bound made easy

Details
Discussion Comments: 0
Verification: Authors have not verified information

Software-improved hardware lock elision

Yehuda Afek, Amir Levy, Adam Morrison

Software-improved hardware lock elision

Details
Discussion Comments: 0
Verification: Authors have not verified information

Consensus with an abstract MAC layer

Calvin C. Newport

Consensus with an abstract MAC layer

Details
Discussion Comments: 0
Verification: Author has not verified information

Efficient lock-free binary search trees

Bapi Chatterjee, Nhan Nguyen Dang, Philippas Tsigas

Efficient lock-free binary search trees

Details
Discussion Comments: 0
Verification: Authors have not verified information

Asynchronous convex hull consensus in the presence of crash faults

Lewis Tseng, Nitin H. Vaidya

Asynchronous convex hull consensus in the presence of crash faults

Details
Discussion Comments: 0
Verification: Authors have not verified information

Linear-in-delta lower bounds in the LOCAL model

Mika Göös, Juho Hirvonen, Jukka Suomela

Linear-in-delta lower bounds in the LOCAL model

Details
Discussion Comments: 0
Verification: Authors have not verified information

On the impact of geometry on ad hoc communication in wireless networks

Tomasz Jurdzinski, Dariusz R. Kowalski, Michal Rozanski, Grzegorz Stachowiak

On the impact of geometry on ad hoc communication in wireless networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

An incomplete history of concurrency chapter 1. 1965-1977

Leslie Lamport

An incomplete history of concurrency chapter 1. 1965-1977

Details
Discussion Comments: 0
Verification: Author has not verified information

Asynchronous MPC with a strict honest majority using non-equivocation

Michael Backes, Fabian Bendun, Ashish Choudhury, Aniket Kate

Asynchronous MPC with a strict honest majority using non-equivocation

Details
Discussion Comments: 0
Verification: Authors have not verified information

On the power of the congested clique model

Andrew Drucker, Fabian Kuhn, Rotem Oshman

On the power of the congested clique model

Details
Discussion Comments: 0
Verification: Authors have not verified information

Distributed connectivity decomposition

Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn

Distributed connectivity decomposition

Details
Discussion Comments: 0
Verification: Authors have not verified information

Fast and unconditionally secure anonymous channel

Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov

Fast and unconditionally secure anonymous channel

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: Super-fast t-ruling sets

Tushar Bisht, Kishore Kothapalli, Sriram V. Pemmaraju

Brief announcement: Super-fast t-ruling sets

Details
Discussion Comments: 0
Verification: Authors have not verified information

Improved distributed steiner forest construction

Christoph Lenzen, Boaz Patt-Shamir

Improved distributed steiner forest construction

Details
Discussion Comments: 0
Verification: Authors have not verified information

Optimal gossip with direct addressing

Bernhard Haeupler, Dahlia Malkhi

Optimal gossip with direct addressing

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures

Manfred Schwarz, Kyrill Winkler, Ulrich Schmid, Martin Biely, Peter Robinson

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures

Details
Discussion Comments: 0
Verification: Authors have not verified information

Dynamic-sized nonblocking hash tables

Yujie Liu, Kunlong Zhang, Michael F. Spear

Dynamic-sized nonblocking hash tables

Details
Discussion Comments: 0
Verification: Authors have not verified information

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems

Dan Alistarh, Oksana Denysyuk, Luís E. T. Rodrigues, Nir Shavit

Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems

Details
Discussion Comments: 0
Verification: Authors have not verified information

How to withstand mobile virus attacks, revisited

Joshua Baron, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky

How to withstand mobile virus attacks, revisited

Details
Discussion Comments: 0
Verification: Authors have not verified information

Time versus cost tradeoffs for deterministic rendezvous in networks

Avery Miller, Andrzej Pelc

Time versus cost tradeoffs for deterministic rendezvous in networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Spanners and sparsifiers in dynamic streams

Michael Kapralov, David P. Woodruff

Spanners and sparsifiers in dynamic streams

Details
Discussion Comments: 0
Verification: Authors have not verified information

Rigorous system design

Joseph Sifakis

Rigorous system design

Details
Discussion Comments: 0
Verification: Author has not verified information

A generalized asynchronous computability theorem

Eli Gafni, Petr Kuznetsov, Ciprian Manolescu

A generalized asynchronous computability theorem

Details
Discussion Comments: 0
Verification: Authors have not verified information

Can quantum communication speed up distributed computation?

Michael Elkin, Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan

Can quantum communication speed up distributed computation?

Details
Discussion Comments: 0
Verification: Authors have not verified information

Brief announcement: concurrency-aware linearizability

Nir Hemed, Noam Rinetzky

Brief announcement: concurrency-aware linearizability

Details
Discussion Comments: 0
Verification: Authors have not verified information