( en | de | ru )

 

Disambiguation of "Turlikov, Andrey M."

Author of the publication

copydeleteadd this publication to your clipboard
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC.

, , , , and . WCNC, page 1-6. IEEE, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrey Gurinov

Andrey Frolov

Andrey Eremeev

Andrey Shornikov

Andrey Timofeev

 

Other publications of authors with the same name

Runtime Minimization of the Threshold Distributed Computation Protocol in the Case of Participants Failures., , and . NEW2AN, volume 11660 of Lecture Notes in Computer Science, page 295-304. Springer, (2019)An efficient multiplication-free and look-up table-free adaptive binary arithmetic coder., , , and . ICIP, page 701-704. IEEE, (2012)Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC., , , , and . WCNC, page 1-6. IEEE, (2019)Upper bound and approximation of random access throughput over chase combining HARQ., , , , , and . ICUMT, page 143-147. IEEE, (2017)eMBMS LTE usage to deliver mobile data., , and . ICUMT, page 60-65. IEEE, (2014)Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel., , , and . CoRR, (2018)Average Delay Estimation in Discrete-Time Systems with Periodically Varying Parameters., , , and . ASMTA, volume 7984 of Lecture Notes in Computer Science, page 37-51. Springer, (2013)A lower bound on mean delay for free access class of RMA algorithms., and . ICT, page 1-4. IEEE, (2008)SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors., , and . NEW2AN, volume 5174 of Lecture Notes in Computer Science, page 13-24. Springer, (2008)Estimation of average delay in systems with unsourced random access and multiple departure., , and . REDUNDANCY, page 28-33. IEEE, (2021)