Nikolay Matveev

Orcid: 0000-0002-9746-4746

According to our database1, Nikolay Matveev authored at least 8 papers between 2012 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian MAC.
Proceedings of the 2019 IEEE Wireless Communications and Networking Conference, 2019

2018
Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel.
CoRR, 2018

A Lower Bound on the Average Identification Time in a Passive RFID System.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networks and Systems, 2018

2017
Throughput Analysis of Adaptive ALOHA Algorithm Using Hybrid-ARQ with Chase Combining in AWGN Channel.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networks and Systems, 2017

Stability and Delay of Algorithms of Random Access with Successive Interference Cancellation.
Proceedings of the Internet of Things, Smart Spaces, and Next Generation Networks and Systems, 2017

Upper bound and approximation of random access throughput over chase combining HARQ.
Proceedings of the 9th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2017

2013
Quite - qq.
Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2013

2012
National Registries in the Russian Healthcare System.
Proceedings of the Large Scale Projects in eHealth, 2012


  Loading...