From post

Efficient Connected Dominating Set Construction with Maximum Lifetime in the Cognitive Radio Networks.

, , , и . IIKI, том 147 из Procedia Computer Science, стр. 446-452. Elsevier, (2018)

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.

 

Другие публикации лиц с тем же именем

Fast Fault-Tolerant Sampling via Random Walk in Dynamic Networks., , , , , , и . ICDCS, стр. 536-544. IEEE, (2019)Fast Distributed Backbone Construction Despite Strong Adversarial Jamming., , , , , , и . INFOCOM, стр. 1027-1035. IEEE, (2019)Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model., , , , , , , и . IPDPS, стр. 835-844. IEEE, (2019)Federating to Grow Transformers with Constrained Resources without Model Sharing., , , , , , и . CoRR, (2024)TBAC: A Tokoin-Based Accountable Access Control Scheme for the Internet of Things., , , , , , , , , и . IEEE Trans. Mob. Comput., 23 (5): 6133-6148 (мая 2024)PPAR: A Privacy-Preserving Adaptive Ranking Algorithm for Multi-Armed-Bandit Crowdsourcing., , , , , и . IWQoS, стр. 1-10. IEEE, (2022)patchVVC: A Real-time Compression Framework for Streaming Volumetric Videos., , , , и . MMSys, стр. 119-129. ACM, (2023)Proactive Deployment of Chain-based VNF Backup at the Edge using Online Bandit Learning., , , и . ICDCS, стр. 740-750. IEEE, (2021)Adaptive Tensor-Train Decomposition for Neural Network Compression., , , и . PDCAT, том 12606 из Lecture Notes in Computer Science, стр. 70-81. Springer, (2020)Offline and online algorithms for single-minded selling problem., , , , , и . Theor. Comput. Sci., (2020)