CCSTM

swMATH33312MaRDI QIDQ45021

No author found.

Source code repository: https://github.com/nbronson/ccstm

Related Items (34)

Bayesian ignorance ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Fast flooding over Manhattan ⋮ The multiplicative power of consensus numbers ⋮ The k -bakery ⋮ On asymmetric progress conditions ⋮ Verifying linearizability with hindsight ⋮ Eventually linearizable shared objects ⋮ The topology of shared-memory adversaries ⋮ Adaptive randomized mutual exclusion in sub-logarithmic expected time ⋮ Distributed data classification in sensor networks ⋮ Partial information spreading with application to distributed maximum coverage ⋮ Efficient threshold detection in a distributed environment ⋮ Forbidden-set distance labels for graphs of bounded doubling dimension ⋮ Efficient distributed random walks with applications ⋮ On the theoretical gap between synchronous and asynchronous MPC protocols ⋮ Hybrid-secure MPC ⋮ Meeting the deadline ⋮ A new technique for distributed symmetry breaking ⋮ On the computational power of oblivious robots ⋮ Finding mobile data under delay constraints with searching costs ⋮ On utilizing speed in networks of mobile agents ⋮ Expansion and the cover time of parallel random walks ⋮ Rapid randomized pruning for fast greedy distributed algorithms ⋮ Broadcasting in unreliable radio networks ⋮ Discrete load balancing is (almost) as easy as continuous load balancing ⋮ Locating a target with an agent guided by unreliable local advice ⋮ Distributed algorithms for edge dominating sets ⋮ Deterministic distributed vertex coloring in polylogarithmic time ⋮ Breaking the O ( n ² ) bit barrier ⋮ Optimal gradient clock synchronization in dynamic networks ⋮ Online set packing and competitive scheduling of multi-part tasks ⋮ How to meet when you forget ⋮ Constant RMR solutions to reader writer synchronization

This page was built for software: CCSTM