Abstract is missing.
- A Decentralized, Scalable, and Autonomous Grid Monitoring SystemLaurent Baduel, Satoshi Matsuoka. 1-15 [doi]
- A Formal Analysis of the Deferred Update TechniqueRodrigo Schmidt, Fernando Pedone. 16-30 [doi]
- ASAP: A Camera Sensor Network for Situation AwarenessJunSuk Shin, Rajnish Kumar, Dushmanta Mohapatra, Umakishore Ramachandran, Mostafa H. Ammar. 31-47 [doi]
- Asynchronous Active Recommendation SystemsBaruch Awerbuch, Aviv Nisgav, Boaz Patt-Shamir. 48-61 [doi]
- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline TasksTheodore P. Baker, Michele Cirinei. 62-75 [doi]
- Byzantine Consensus with Few Synchronous LinksMoumen Hamouma, Achour Mostéfaoui, Gilles Trédan. 76-89 [doi]
- Clock Synchronization in the Byzantine-Recovery Failure ModelEmmanuelle Anceaume, Carole Delporte-Gallet, Hugues Fauconnier, Michel Hurfin, Josef Widder. 90-104 [doi]
- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious RobotsPaola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro. 105-118 [doi]
- Deterministic Communication in the Weak Sensor ModelAntonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves. 119-131 [doi]
- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated SystemYoann Dieudonné, Franck Petit. 132-142 [doi]
- Distance Sensitive Snapshots in Wireless Sensor NetworksVinodkrishnan Kulathumani, Anish Arora. 143-158 [doi]
- Distributed Approximation Algorithms for Finding 2-Edge-Connected SubgraphsSven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp. 159-173 [doi]
- Does Clock Precision Influence ZigBee s Energy Consumptions?Christian Groß, Holger Hermanns, Reza Pulungan. 174-188 [doi]
- From an Intermittent Rotating Star to a LeaderAntonio Fernández Anta, Michel Raynal. 189-203 [doi]
- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task SystemsSanjoy K. Baruah, Nathan Fisher. 204-216 [doi]
- LFthreads: A Lock-Free Thread LibraryAnders Gidenstam, Marina Papatriantafilou. 217-231 [doi]
- Making Distributed Applications RobustChi Ho, Danny Dolev, Robbert van Renesse. 232-246 [doi]
- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc NetworksTiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri. 247-259 [doi]
- N-Consensus is the Second Strongest Object for N+1 ProcessesEli Gafni, Petr Kuznetsov. 260-273 [doi]
- Non-Searchability of Random Power-Law GraphsPhilippe Duchon, Nicole Eggemann, Nicolas Hanusse. 274-285 [doi]
- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1James Aspnes, Yinghua Wu. 286-300 [doi]
- On the Self-stabilization of Mobile Robots in GraphsLélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil. 301-314 [doi]
- Peer to Peer Multidimensional Overlays: Approximating Complex StructuresOlivier Beaumont, Anne-Marie Kermarrec, Etienne Riviere. 315-328 [doi]
- Secretive Birds: Privacy in Population ProtocolsCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert. 329-342 [doi]
- Self-stabilizing and Byzantine-Tolerant Overlay NetworkDanny Dolev, Ezra N. Hoch, Robbert van Renesse. 343-357 [doi]
- Separability to Help Parallel Simulation of Distributed ComputationsPhilippe Mauran, Gérard Padiou, Philippe Quéinnec. 358-371 [doi]
- Small-World Networks: From Theoretical Bounds to Practical SystemsFrançois Bonnet, Anne-Marie Kermarrec, Michel Raynal. 372-385 [doi]
- The Anonymous Consensus Hierarchy and Naming ProblemsEric Ruppert. 386-400 [doi]
- The Baskets QueueMoshe Hoffman, Ori Shalev, Nir Shavit. 401-414 [doi]
- The Cost of Monotonicity in Distributed Graph SearchingDavid Ilcinkas, Nicolas Nisse, David Soguet. 415-428 [doi]
- Timed Quorum Systems for Large-Scale and Dynamic EnvironmentsVincent Gramoli, Michel Raynal. 429-442 [doi]
- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?James Aspnes, Navin Rustagi, Jared Saia. 443-456 [doi]