Although we do not profess to be capable of defining a `roadmap' for the foundations of SE over the next ten years, we can discern some important steps that would be extremel...
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...