5 citations · 6 across the 9 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2018
Why Extension-Based Proofs Fail
Dan Alistarh, James Aspnes, Faith Ellen +2
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using pro…
cs.DC2012
A one-bit swap object using test-and-sets and a max register
James Aspnes
We describe a linearizable, wait-free implementation of a one-bit swap object from a single max register and an unbounded array of test-and-set bits. Each swap operation takes at m…
cs.DC2010★ 5 cited
Slightly smaller splitter networks
James Aspnes
The classic renaming protocol of Moir and Anderson (1995) uses a network of Theta(n^2) splitters to assign unique names to n processes with unbounded initial names. We show how to…