Okay, let me say from the start that I'm not trying to get anybody to do my homework for me. I'm looking for pointers to information, not trying to wheedle somebody into writing my code.<P>I'm working ...

An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...

Necessary and sufficient conditions for a generalized binary proper block design with two different replication numbers to be efficiency-balanced (EB) are given. Binary block designs such as balanced ...