| A Time Complexity Bound for Adaptive Mutual Exclusion Quorum-Based Algorithms for Guoup Mutual Exclusion An Effective Characterization of Computablility in Anonymous Networks Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System Optimal Unconditional Information Diffusion Computation Slicing:Techniques and Theory Stable Leader Election Adaptive Long-Lived O(k2)-Renaming withO(k2)Steps A New Synchronous Lower Bound for Set Agreement The Complexity of Synchronous Iterative Do-All with Crashes Mobile Search for a Black Hole in an Anonymous Ring Randomised Mutual Search for K＞2 Agents Self-Stabilizing Spanning Treee Construction on Message-Passing Networks Self Stabilizing Distributed Queuing A Space Optimal Deterministic Self-Stabilizing Leader Election Algorithm for Unidirectional Rings Randomized Finite-State Distributed ALgorithms ans markow Chains The Average Hop Count Measure for Virtual Path Layouts Efficient Routing in Networks with Long Range Contacts An Efficient Communication Strategy for Ad-hoc Mobile Networks A Pragmatic Implementation of Non-blocking Linked -Lists Stabilizing Replicated Search Tress Adding Networks Author Index |
内容加载中，请稍后...
商品评论（0条）