PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nikoletseas, Sotiris E."

Author of the publication

copydeleteadd this publication to your clipboard
A Service Based Architecture for Multidisciplinary IoT Experiments with Crowdsourced Resources.

, , , , , , , , , , , and . ADHOC-NOW, volume 9724 of Lecture Notes in Computer Science, page 187-201. Springer, (2016)

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.

E. Garrelts

E. Zafeiriou

P. E. Bl\"ochl

Andr{\'{e}} Buchau

Umm-E Habiba University of Stuttgart

 

Other publications of authors with the same name

Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles., , , and . Wireless Communications and Mobile Computing, 10 (5): 647-661 (2010)On the energy balance problem in distributed sensor networks.. Computer Science Review, 4 (2): 65-79 (2010)Exploiting limited density information towards near-optimal energy balanced data propagation., , , and . Computer Communications, 35 (18): 2187-2200 (2012)Adaptive Energy Management for Incremental Deployment of Heterogeneous Wireless Sensors., , and . Theory Comput. Syst., 42 (1): 42-72 (2008)Algorithms and Experiments on Colouring Squares of Planar Graphs., , and . WEA, volume 2647 of Lecture Notes in Computer Science, page 15-32. Springer, (2003)A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback., , , , and . SAGT, volume 10504 of Lecture Notes in Computer Science, page 240-251. Springer, (2017)Strategic Contention Resolution with Limited Feedback., , , , and . ESA, volume 57 of LIPIcs, page 30:1-30:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time., , , and . ICALP, volume 944 of Lecture Notes in Computer Science, page 159-170. Springer, (1995)How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs?, , , , , and . ICALP, volume 132 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2019)Adaptive Data Dissemination in Mobile Sensor Networks., and . Journal of Interconnection Networks, 10 (4): 435-457 (2009)