Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
The standard model of a multiple access channel with ternary feedback is considered. When packets of a batch of k nodes initially collide, it is assumed that no a priori statistical information about k is available. A new algorithm is presented and analyzed that enables the nodes to compute a statistical estimate of k. Combining the estimation procedure with tree algorithms leads to batch resolution algorithms that resolve conflicts more efficiently than any other reported to date. Both complete resolution and partial resolution algorithms are presented. © 1988 IEEE
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Gabriele Dominici, Pietro Barbiero, et al.
ICLR 2025