This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
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...