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...
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Don...
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
This paper presents a complete algorithm for the evaluation and control of error in radiosity calculations. Providing such control is both extremely important for industrial appli...