We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
—The IEEE 802.15.4 standard specifies an M-ary spread spectrum system with public and fixed spreading sequences. We propose instead to use secret and dynamic, random spreading ...
Bjorn Muntwyler, Vincent Lenders, Franck Legendre,...
Abstract—We study distributed algorithms for updating transmit precoding matrices for a two-user Multi-Input/Multi-Output (MIMO) interference channel. Our objective is to maximiz...
Changxin Shi, David A. Schmidt, Randall A. Berry, ...