Theoretical Computer Science, Volume 344

Volume 344, Number 1, 11 November 2005

Algorithmic Aspects of Wireless Sensor Networks

Sotiris E. Nikoletseas, José D. P. Rolim:
Preface. 1-2
Christos H. Papadimitriou, David Ratajczak:
On a conjecture related to geometric routing. 3-14
Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani:
Scale-free aggregation in sensor networks. 15-29
Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Exact and approximate balanced data gathering in energy-constrained sensor networks. 30-46
Regina O'Dell, Roger Wattenhofer:
Theoretical aspects of connectivity-based multi-hop positioning. 47-68
Pierre Leone, José D. P. Rolim:
Towards a dynamical model for wireless sensor networks. 69-85
Gideon Stupp, Moshe Sidi:
The expected uncertainty of range-free localization protocols in sensor networks. 86-99

Grzegorz Rozenberg:
Preface. 101-102
Hongtao Lu, Ruimin Shen, Fu-Lai Chung:
Absolute exponential stability of a class of recurrent neural networks with multiple and variable delays. 103-119
Oscar H. Ibarra:
On determinism versus nondeterminism in P systems. 120-133
Mingsheng Ying:
A theory of computation based on quantum logic (I). 134-207
Simon Fischer, Ingo Wegener:
The one-dimensional Ising model: Mutation versus recombination. 208-225
Sergey Verlan:
A boundary result on enhanced time-varying distributed H systems with parallel computations. 226-242
Marco Dorigo, Christian Blum:
Ant colony optimization theory: A survey. 243-278
David Soloveichik, Erik Winfree:
The computational power of Benenson automata. 279-297
Aurélie Goulon-Sigwalt-Abram, Arthur F. Duprat, Gérard Dreyfus:
From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data. 298-334
Yaoyun Shi:
Quantum and classical tradeoffs. 335-345

Last update Tue Feb 14 04:22:58 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page