Author of the publication

Connectionless probabilistic (CoP) routing: an efficient protocol for mobile wireless ad-hoc sensor networks.

, , and . IPCCC, page 73-77. IEEE, (2005)

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.

No persons found for author name Navarra, Alfredo
add a person with the name Navarra, Alfredo
 

Other publications of authors with the same name

Improved approximation results for the minimum energy broadcasting problem., , , and . DIALM-POMC, page 85-91. ACM, (2004)CER-CH: Combining Election and Routing Amongst Cluster Heads in Heterogeneous WSNs., , and . IEEE Access, (2019)Minimize the Maximum Duty in Multi-interface Networks., , and . Algorithmica, 63 (1-2): 274-295 (2012)Gathering of robots on anonymous grids and trees without multiplicity detection., , , and . Theor. Comput. Sci., (2016)On Gathering of Semi-synchronous Robots in Graphs., , and . SSS, volume 11914 of Lecture Notes in Computer Science, page 84-98. Springer, (2019)Synthesis of decentralized and concurrent adaptors for correctly assembling distributed component-based systems., , , and . Journal of Systems and Software, 81 (12): 2210-2236 (2008)Efficient offline algorithms for the bicriteria k-server problem and online applications., , and . J. Discrete Algorithms, 4 (3): 414-432 (2006)Wireless ATM Layouts for Chain Networks., , and . MONET, 10 (1-2): 35-45 (2005)The "real" approximation factor of the MST heuristic for the minimum energy broadcasting., , and . ACM Journal of Experimental Algorithmics, (2006)Characterizing the Computational Power of Anonymous Mobile Robots., , and . ICDCS, page 293-302. IEEE Computer Society, (2016)