Full Citation in the ACM Digital LibrarySESSION: Keynote 1
Some Sequential Algorithms are Almost Always Parallel
SESSION: Session 1
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
The Space Requirement of Local Forwarding on Acyclic Networks
Communication Primitives in Cognitive Radio Networks
Broadcasting in Noisy Radio Networks
Gossip in a Smartphone Peer-to-Peer Network
SESSION: Session 2
Analyzing Contention and Backoff in Asynchronous Shared Memory
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
Seeing is Believing: A Client-Centric Specification of Database Isolation
Space Complexity of Fault-Tolerant Register Emulations
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write
Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers
Brief Announcement: Fence Insertion for Straight-line Programs is in P
SESSION: Session 3
On the Multiparty Communication Complexity of Testing Triangle-Freeness
Distributed MST and Routing in Almost Mixing Time
Distributed MIS via All-to-All Communication
Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination
SESSION: Keynote 2
Blockchains and the Future of Distributed Computing (slides)
SESSION: Session 4
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
Distributed Approximation of Maximum Independent Set and Maximum Matching
Optimal Distance Labeling Schemes for Trees
Brief Announcement: How Large is your Graph?
Brief Announcement: Distributed Approximation for Tree Augmentation
Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control
SESSION: Session 5
Recoverable Mutual Exclusion in Sub-logarithmic Time
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model
Transactional Lock Elision Meets Combining
On Using Time Without Clocks via Zigzag Causality
Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures
Brief Announcement: Gossiping with Latencies
SESSION: Session 6
Effectiveness of Delaying Timestamp Computation
Symmetry Breaking with Noisy Processes
The Power of Choice in Priority Scheduling
A Template for Implementing Fast Lock-free Trees Using HTM
Adding Concurrency to Smart Contracts
SESSION: Keynote 3
Verifiable Outsourced Computation: A Survey
SESSION: Session 7
FruitChains: A Fair Blockchain
Coordination Without Prior Agreement
Ignore or Comply?: On Breaking Symmetry in Consensus
Brief Announcement: Hierarchical Consensus
Brief Announcement: Statement Voting and Liquid Democracy
Brief Announcement: Rapid Asynchronous Plurality Consensus
Brief Announcement: Object Oriented Consensus
SESSION: Session 8
Greedy Routing and the Algorithmic Small-World Phenomenon
Triangle Finding and Listing in CONGEST Networks
Self-organized Segregation on the Grid
Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks
Brief Announcement: Secure Self-Stabilizing Computation
SESSION: Session 9
Towards Efficient Verification of Population Protocols
A Distributed Learning Dynamics in Social Groups
Brief Announcement: Byzantine-Tolerant Machine Learning
Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret