The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. The 2009 Edsger W. Dijkstra Prize in Distributed Computing. [Citation Graph (, )][DBLP]

  2. Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement! [Citation Graph (, )][DBLP]

  3. What Agreement Problems Owe Michel. [Citation Graph (, )][DBLP]

  4. Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing. [Citation Graph (, )][DBLP]

  5. Shmuel Zaks - The Mathematician, Computer Scientist and Personality. [Citation Graph (, )][DBLP]

  6. The Disagreement Power of an Adversary. [Citation Graph (, )][DBLP]

  7. New Bounds for the Controller Problem. [Citation Graph (, )][DBLP]

  8. On Set Consensus Numbers. [Citation Graph (, )][DBLP]

  9. The Abstract MAC Layer. [Citation Graph (, )][DBLP]

  10. Randomization Can Be a Healer: Consensus with Dynamic Omission Failures. [Citation Graph (, )][DBLP]

  11. Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method. [Citation Graph (, )][DBLP]

  12. Elastic Transactions. [Citation Graph (, )][DBLP]

  13. Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. [Citation Graph (, )][DBLP]

  14. Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. [Citation Graph (, )][DBLP]

  15. The RedBlue Adaptive Universal Constructions. [Citation Graph (, )][DBLP]

  16. Help When Needed, But No More: Efficient Read/Write Partial Snapshot. [Citation Graph (, )][DBLP]

  17. Contention-Sensitive Data Structures and Algorithms. [Citation Graph (, )][DBLP]

  18. Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms. [Citation Graph (, )][DBLP]

  19. Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset. [Citation Graph (, )][DBLP]

  20. Local Computation of Nearly Additive Spanners. [Citation Graph (, )][DBLP]

  21. A Local 2-Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (, )][DBLP]

  22. Distributed Discovery of Large Near-Cliques. [Citation Graph (, )][DBLP]

  23. Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. [Citation Graph (, )][DBLP]

  24. Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. [Citation Graph (, )][DBLP]

  25. Brief Announcement: Towards Secured Distributed Polling in Social Networks. [Citation Graph (, )][DBLP]

  26. What Can Be Observed Locally? [Citation Graph (, )][DBLP]

  27. At-Most-Once Semantics in Asynchronous Shared Memory. [Citation Graph (, )][DBLP]

  28. Nonblocking Algorithms and Backward Simulation. [Citation Graph (, )][DBLP]

  29. Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction. [Citation Graph (, )][DBLP]

  30. Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison. [Citation Graph (, )][DBLP]

  31. Dynamics in Network Interaction Games. [Citation Graph (, )][DBLP]

  32. Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers. [Citation Graph (, )][DBLP]

  33. On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. [Citation Graph (, )][DBLP]

  34. Crash-Quiescent Failure Detection. [Citation Graph (, )][DBLP]

  35. The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity. [Citation Graph (, )][DBLP]

  36. Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model. [Citation Graph (, )][DBLP]

  37. Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. [Citation Graph (, )][DBLP]

  38. Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. [Citation Graph (, )][DBLP]

  39. Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol. [Citation Graph (, )][DBLP]

  40. Compact Multicast Routing. [Citation Graph (, )][DBLP]

  41. Compact Routing in Power-Law Graphs. [Citation Graph (, )][DBLP]

  42. Virtual Ring Routing Trends. [Citation Graph (, )][DBLP]

  43. A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. [Citation Graph (, )][DBLP]

  44. Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]

  45. Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle. [Citation Graph (, )][DBLP]

  46. On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. [Citation Graph (, )][DBLP]

  47. From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits. [Citation Graph (, )][DBLP]

  48. Brief Announcement: A Leader-free Byzantine Consensus Algorithm. [Citation Graph (, )][DBLP]

  49. Efficient k-Shot Broadcasting in Radio Networks. [Citation Graph (, )][DBLP]

  50. Keeping Mobile Robot Swarms Connected. [Citation Graph (, )][DBLP]

  51. Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]

  52. Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]

  53. Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002