CCSTM

swMATH33312MaRDI QIDQ45021FDOQ45021

Author name not available (Why is that?)

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

Cited In (34)

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

This page was built for software: CCSTM