Optimal contention among three senders
Claude A. Christen · IEEE Transactions on Information Theory · 1988
The tests allowed in conflict resolution problems have usually three types of outcomes, according to whether the test contains zero, one, or at least two senders. The question of locating three elements in a given interval of the real line with the least number of such tests is studied. A nested detection algorithm is provided which is then proven to be optimal. For this purpose, extensive use is made of a principle allowing interpolation between lower bounds.>