This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
Claris Castillo, George N. Rouskas, Khaled Harfous...