The one-way function tree (OFT) scheme proposed by Balenson et. al is widely regarded as an efficient key management solution for multicast communication in large dynamic groups. ...
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously, is a function f of the size of the piles. Wytho...