( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A new random walk for efficient data collection in sensor networks.

, , , и . MOBIWAC, стр. 53-60. ACM, (2011)

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.

Sotiris Manitsaris

Sotiris Mitralexis

Sotiris Moschoyiannis

Ursula E E Köhler

E Berl

 

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

Improving sensor network performance with wireless energy transfer., , , , и . Int. J. Ad Hoc Ubiquitous Comput., 20 (3): 159-171 (2015)Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles., , , и . Wirel. Commun. Mob. Comput., 10 (5): 647-661 (2010)Radiocoloring in planar graphs: Complexity and approximations., , , и . Theor. Comput. Sci., 340 (3): 514-538 (2005)MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems., , и . Algorithmica, 85 (9): 2817-2842 (сентября 2023)On the independence number and Hamiltonicity of uniform random intersection graphs., , и . Theor. Comput. Sci., 412 (48): 6750-6760 (2011)The Impact of Network Structure on the Stability of Greedy Protocols., , , и . Theory Comput. Syst., 38 (4): 425-460 (2005)Attack Propagation in Networks., , , и . Theory Comput. Syst., 36 (5): 553-574 (2003)Adaptive Data Dissemination in Mobile Sensor Networks., и . J. Interconnect. Networks, 10 (4): 435-457 (2009)A multidimensional human-centric framework for environmental intelligence: Air pollution and noise in smart cities., , , , , и . DCOSS, стр. 155-164. IEEE, (2020)How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?, , , , , и . ICALP, том 132 из LIPIcs, стр. 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)