Conferences in DBLP

International Conference On Principles Of DIstributed Systems (opodis)
2007 (conf/opodis/2007)

1. 
   A Decentralized, Scalable, and Autonomous Grid Monitoring System. [Citation Graph (, )][DBLP]
   
   
2. 
   A Formal Analysis of the Deferred Update Technique. [Citation Graph (, )][DBLP]
   
   
3. 
   ASAP: A Camera Sensor Network for Situation Awareness. [Citation Graph (, )][DBLP]
   
   
4. 
   Asynchronous Active Recommendation Systems. [Citation Graph (, )][DBLP]
   
   
5. 
   Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks. [Citation Graph (, )][DBLP]
   
   
6. 
   Byzantine Consensus with Few Synchronous Links. [Citation Graph (, )][DBLP]
   
   
7. 
   Clock Synchronization in the Byzantine-Recovery Failure Model. [Citation Graph (, )][DBLP]
   
   
8. 
   Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. [Citation Graph (, )][DBLP]
   
   
9. 
   Deterministic Communication in the Weak Sensor Model. [Citation Graph (, )][DBLP]
   
   
10. 
    Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System. [Citation Graph (, )][DBLP]
    
    
11. 
    Distance Sensitive Snapshots in Wireless Sensor Networks. [Citation Graph (, )][DBLP]
    
    
12. 
    Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Does Clock Precision Influence ZigBee's Energy Consumptions?. [Citation Graph (, )][DBLP]
    
    
14. 
    From an Intermittent Rotating Star to a Leader. [Citation Graph (, )][DBLP]
    
    
15. 
    Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems. [Citation Graph (, )][DBLP]
    
    
16. 
    LFthreads: A Lock-Free Thread Library. [Citation Graph (, )][DBLP]
    
    
17. 
    Making Distributed Applications Robust. [Citation Graph (, )][DBLP]
    
    
18. 
    Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. [Citation Graph (, )][DBLP]
    
    
19. 
    N-Consensus is the Second Strongest Object for N+1 Processes. [Citation Graph (, )][DBLP]
    
    
20. 
    Non-Searchability of Random Power-Law Graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1. [Citation Graph (, )][DBLP]
    
    
22. 
    On the Self-stabilization of Mobile Robots in Graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Peer to Peer Multidimensional Overlays: Approximating Complex Structures. [Citation Graph (, )][DBLP]
    
    
24. 
    Secretive Birds: Privacy in Population Protocols. [Citation Graph (, )][DBLP]
    
    
25. 
    Self-stabilizing and Byzantine-Tolerant Overlay Network. [Citation Graph (, )][DBLP]
    
    
26. 
    Separability to Help Parallel Simulation of Distributed Computations. [Citation Graph (, )][DBLP]
    
    
27. 
    Small-World Networks: From Theoretical Bounds to Practical Systems. [Citation Graph (, )][DBLP]
    
    
28. 
    The Anonymous Consensus Hierarchy and Naming Problems. [Citation Graph (, )][DBLP]
    
    
29. 
    The Baskets Queue. [Citation Graph (, )][DBLP]
    
    
30. 
    The Cost of Monotonicity in Distributed Graph Searching. [Citation Graph (, )][DBLP]
    
    
31. 
    Timed Quorum Systems for Large-Scale and Dynamic Environments. [Citation Graph (, )][DBLP]
    
    
32. 
    Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?. [Citation Graph (, )][DBLP]