![]() |
Welcome to
opodis 2005 9th International Conference on December 12--14, 2005, Pisa, Italy |
Home |
List of Accepted Papers
A Lazy Concurrent List-based Set Algorithm A Self-Stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks A State-based Model of Sensor Protocols Approximation bounds for Black Hole Search problems Asynchronous and Fully Self-Stabilizing Time-Adaptive Majority Consensus Bounding Communication cost in Dynamic Load Balancing of Distributed Hash Tables Can memory be used adaptively by uniform algorithms? Efficiently Implementing a Large Number of LL/SC Objects Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner Implementing Reliable Distributed Real-Time Systems MTcast: Robust and Efficient P2P-based Video Delivery for Heterogeneous Requirements New Schedulability Tests for Real-Time tasks sets scheduled by Deadline Monotonic on Multiprocessors Node Discovery in Networks On the power of anonymous one-way communication Optimal Clock Synchronization under Energy Constraints in Wireless Ad-Hoc Networks Optimal Randomized Omission-Tolerant Uniform Consensus in Message Passing Systems Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast Quality-Aware Resource Management for Wireless Sensor Networks Randomized Wait-Free Consensus using An Atomicity Assumption Reconfigurable Distributed Storage for Dynamic Networks Revising UNITY Programs: Possibilities and Limitations Self-stabilizing Behavior in Networks of Nondeterministically Interacting Sensors Skip B-Trees Stable Predicate Detection in Dynamic Systems Static-Priority Scheduling of Sporadic Messages on a Wireless Channel The Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms Timed Virtual Stationary Automata for Mobile Networks Topology Control with Limited Geometric Information Towards a theory of self-organization Two Abstractions for Implementing Atomic Objects in Dynamic Systems |