


default search action
Theoretical Computer Science, Volume 453
Volume 453, September 2012
- Shlomi Dolev
, Christian Scheideler:
Editorial for Algorithmic Aspects of Wireless Sensor Networks. 1
- Chen Avin
, Zvi Lotker, Francesco Pasquale
, Yvonne-Anne Pignolet:
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model. 2-13 - Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky:
Near-optimal radio use for wireless network synchronization. 14-28 - Stephan Holzer, Yvonne-Anne Pignolet, Jasmin Smula, Roger Wattenhofer:
Monitoring churn in wireless networks. 29-43 - Florian Huc, Aubin Jarry, Pierre Leone, José D. P. Rolim:
Virtual raw anchor coordinates: A new localization paradigm. 44-53 - Iyad A. Kanj, Ge Xia:
Improved local algorithms for spanner construction. 54-64 - Marek Klonowski, Miroslaw Kutylowski, Jan Zatopianski:
Energy efficient alert in single-hop networks of extremely weak devices. 65-74 - Jacek Cichon
, Zbigniew Golebiewski, Miroslaw Kutylowski:
From key predistribution to key redistribution. 75-87 - Zeev Nutov, Michael Segal
:
Improved approximation algorithms for maximum lifetime problems in wireless networks. 88-97 - Johannes Wendeberg, Thomas Janson, Christian Schindelhauer
:
Self-Localization based on Ambient Signals. 98-109

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.