The SCEAS System
Navigation Menu

Conferences in DBLP

International Symposium on Distributed Computing (DISC) (wdag)
2008 (conf/wdag/2008)


  1. The Mailbox Problem. [Citation Graph (, )][DBLP]


  2. Matrix Signatures: From MACs to Digital Signatures in Distributed Systems. [Citation Graph (, )][DBLP]


  3. How to Solve Consensus in the Smallest Window of Synchrony. [Citation Graph (, )][DBLP]


  4. Local Terminations and Distributed Computability in Anonymous Networks. [Citation Graph (, )][DBLP]


  5. A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. [Citation Graph (, )][DBLP]


  6. Fast Distributed Approximations in Planar Graphs. [Citation Graph (, )][DBLP]


  7. Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion. [Citation Graph (, )][DBLP]


  8. The Weakest Failure Detector for Message Passing Set-Agreement. [Citation Graph (, )][DBLP]


  9. Local Maps: New Insights into Mobile Agent Algorithms. [Citation Graph (, )][DBLP]


  10. r3: Resilient Random Regular Graphs. [Citation Graph (, )][DBLP]


  11. Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics. [Citation Graph (, )][DBLP]


  12. Constant-Space Localized Byzantine Consensus. [Citation Graph (, )][DBLP]


  13. Optimistic Erasure-Coded Distributed Storage. [Citation Graph (, )][DBLP]


  14. On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing. [Citation Graph (, )][DBLP]


  15. On Radio Broadcasting in Random Geometric Graphs. [Citation Graph (, )][DBLP]


  16. Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. [Citation Graph (, )][DBLP]


  17. Deterministic Rendezvous in Trees with Little Memory. [Citation Graph (, )][DBLP]


  18. Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. [Citation Graph (, )][DBLP]


  19. Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP]


  20. On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. [Citation Graph (, )][DBLP]


  21. Permissiveness in Transactional Memories. [Citation Graph (, )][DBLP]


  22. The Synchronization Power of Coalesced Memory Accesses. [Citation Graph (, )][DBLP]


  23. Optimizing Threshold Protocols in Adversarial Structures. [Citation Graph (, )][DBLP]


  24. Hopscotch Hashing. [Citation Graph (, )][DBLP]


  25. Computing Lightweight Spanners Locally. [Citation Graph (, )][DBLP]


  26. Dynamic Routing and Location Services in Metrics of Low Doubling Dimension. [Citation Graph (, )][DBLP]


  27. Leveraging Linial's Locality Limit. [Citation Graph (, )][DBLP]


  28. Continuous Consensus with Failures and Recoveries. [Citation Graph (, )][DBLP]


  29. No Double Discount: Condition-Based Simultaneity Yields Limited Gain. [Citation Graph (, )][DBLP]


  30. Bosco: One-Step Byzantine Asynchronous Consensus. [Citation Graph (, )][DBLP]


  31. A Limit to the Power of Multiple Nucleation in Self-assembly. [Citation Graph (, )][DBLP]


  32. Using Bounded Model Checking to Verify Consensus Algorithms. [Citation Graph (, )][DBLP]


  33. Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks. [Citation Graph (, )][DBLP]


  34. Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. [Citation Graph (, )][DBLP]


  35. The Dynamics of Probabilistic Population Protocols. [Citation Graph (, )][DBLP]


  36. A Distributed Algorithm for Computing and Updating the Process Number of a Forest. [Citation Graph (, )][DBLP]


  37. Brief Announcment: Corruption Resilient Fountain Codes. [Citation Graph (, )][DBLP]


  38. Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. [Citation Graph (, )][DBLP]


  39. Easy Consensus Algorithms for the Crash-Recovery Model. [Citation Graph (, )][DBLP]


  40. Evaluating the Quality of a Network Topology through Random Walks. [Citation Graph (, )][DBLP]


  41. Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. [Citation Graph (, )][DBLP]


  42. Data Failures. [Citation Graph (, )][DBLP]


  43. Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network. [Citation Graph (, )][DBLP]


  44. Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002