SICTA: a 0.693 contention tree algorithm using successive interference cancellation

Yingqun Yu, Georgios B. Giannakis. SICTA: a 0.693 contention tree algorithm using successive interference cancellation. In INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA. pages 1908-1916, IEEE, 2005. [doi]

@inproceedings{YuG05:2,
  title = {SICTA: a 0.693 contention tree algorithm using successive interference cancellation},
  author = {Yingqun Yu and Georgios B. Giannakis},
  year = {2005},
  doi = {10.1109/INFCOM.2005.1498469},
  url = {http://dx.doi.org/10.1109/INFCOM.2005.1498469},
  researchr = {https://researchr.org/publication/YuG05%3A2},
  cites = {0},
  citedby = {0},
  pages = {1908-1916},
  booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA},
  publisher = {IEEE},
}