CCSTM - MaRDI portal

Author name not available (Why is that?)

Official website: https://ppl.stanford.edu/papers/scaladays2010bronson.pdf

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

Cited In (34)

On the computational power of oblivious robots
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
Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
A new technique for distributed symmetry breaking
Efficient threshold detection in a distributed environment (extended abstract)
Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
Efficient distributed random walks with applications
Bayesian ignorance
The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
Partial information spreading with application to distributed maximum coverage
How to meet when you forget: log-space rendezvous in arbitrary graphs
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
Distributed algorithms for \textsc{Edge Dominating Sets}
Broadcasting in unreliable radio networks
Distributed data classification in sensor networks
Discrete load balancing is (almost) as easy as continuous load balancing
Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
Eventually linearizable shared objects
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