Time Complexity Bound for Adaptive Mutual Exclusion -- Quorum-Based Algorithms for Group Mutual Exclusion -- Effective Characterization of Computability in Anonymous Networks -- Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System -- Optimal Unconditional Information Diffusion -- Computation Slicing -- Low-Latency Non-blocking Commit Service -- Stable Leader Election -- New Synchronous Lower Bound for Set Agreement -- Mobile Search for a Black Hole in an Anonymous Ring -- Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks -- Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings -- Randomized Finite-State Distributed Algorithms as Markov Chains -- Average Hop Count Measure for Virtual Path Layouts -- Efficient Routing in Networks with Long Range Contacts -- Efficient Communication Strategy for Ad-hoc Mobile Networks

1. Electronic data processing -- Distributed processing -- Congresses