BibTeX record conf/wcnc/GlebovMAFT19

download as .bib file

@inproceedings{DBLP:conf/wcnc/GlebovMAFT19,
  author       = {Anton Glebov and
                  Nikolay Matveev and
                  Kirill V. Andreev and
                  Alexey A. Frolov and
                  Andrey M. Turlikov},
  title        = {Achievability Bounds for T-Fold Irregular Repetition Slotted {ALOHA}
                  Scheme in the Gaussian {MAC}},
  booktitle    = {2019 {IEEE} Wireless Communications and Networking Conference, {WCNC}
                  2019, Marrakesh, Morocco, April 15-18, 2019},
  pages        = {1--6},
  publisher    = {{IEEE}},
  year         = {2019},
  url          = {https://doi.org/10.1109/WCNC.2019.8885472},
  doi          = {10.1109/WCNC.2019.8885472},
  timestamp    = {Mon, 03 Jan 2022 22:25:23 +0100},
  biburl       = {https://dblp.org/rec/conf/wcnc/GlebovMAFT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.