By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robert...
In UMTS mobile networks, there are some circumstances that the International Mobile Subscriber Identity (IMSI) of a user is conveyed in clear-text over the radio interface. Such s...
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...