A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
— We present a modular robot design inspired by the creation of complex structures and functions in biology via deformation. Our design is based on the Tensegrity model of cellul...
Chih-Han Yu, Kristina Haller, Donald E. Ingber, Ra...
This paper introduces a novel approach for augmenting attributebased access control systems in a way that allows them to offer fully anonymous access to resources while at the sam...
Modern file systems associate the deletion of a file with the release of the storage associated with that file, and file writes with the irrevocable change of file contents. We pr...
Douglas J. Santry, Michael J. Feeley, Norman C. Hu...