| 2008 |
|---|
| 13 | EE | Andrei Marculescu,
Sotiris E. Nikoletseas,
Olivier Powell,
José D. P. Rolim:
Lighweight Target Tracking Using Passive Traces in Sensor Networks
CoRR abs/0803.2219: (2008) |
| 2007 |
|---|
| 12 | EE | Olivier Powell,
Sotiris E. Nikoletseas:
Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks.
WEA 2007: 161-174 |
| 11 | EE | Olivier Powell,
Luminita Moraru,
Jean-Marc Seigneur:
TrustMIX: Trustworthy MIX for Energy Saving in Sensor Networks
CoRR abs/0705.2313: (2007) |
| 10 | EE | Olivier Powell,
Sotiris Nikolesteas:
Geographic Routing Around Obstacles in Wireless Sensor Networks
CoRR abs/cs/0703094: (2007) |
| 9 | EE | Olivier Powell,
Pierre Leone,
José D. P. Rolim:
Energy optimal data propagation in wireless sensor networks.
J. Parallel Distrib. Comput. 67(3): 302-317 (2007) |
| 2006 |
|---|
| 8 | EE | Pierre Leone,
Luminita Moraru,
Olivier Powell,
José D. P. Rolim:
Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition.
ALGOSENSORS 2006: 119-129 |
| 7 | EE | Aubin Jarry,
Pierre Leone,
Olivier Powell,
José D. P. Rolim:
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks.
DCOSS 2006: 405-421 |
| 2005 |
|---|
| 6 | EE | Pierre Leone,
Olivier Powell,
José D. P. Rolim:
Energy Optimal Data Propagation in Wireless Sensor Networks
CoRR abs/cs/0508052: (2005) |
| 5 | EE | Olivier Powell,
Aubin Jarry,
Pierre Leone,
José D. P. Rolim:
Gradient Based Routing in Wireless Sensor Networks: a Mixed Strategy
CoRR abs/cs/0511083: (2005) |
| 4 | EE | Olivier Powell:
Almost Completeness in Small Complexity Classes
Electronic Colloquium on Computational Complexity (ECCC)(010): (2005) |
| 2004 |
|---|
| 3 | EE | Olivier Powell:
A note on measuring in P.
Theor. Comput. Sci. 320(2-3): 229-246 (2004) |
| 2003 |
|---|
| 2 | EE | Olivier Powell:
PSPACE contains almost complete problems
Electronic Colloquium on Computational Complexity (ECCC) 10(028): (2003) |
| 2002 |
|---|
| 1 | EE | Olivier Powell:
Measure on P revisited
Electronic Colloquium on Computational Complexity (ECCC)(065): (2002) |
