|
Conferences in DBLP
The 2009 Edsger W. Dijkstra Prize in Distributed Computing. [Citation Graph (, )][DBLP]
Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement! [Citation Graph (, )][DBLP]
What Agreement Problems Owe Michel. [Citation Graph (, )][DBLP]
Shmuel Zaks - The Early Years: A Combinatorialist in Distributed Computing. [Citation Graph (, )][DBLP]
Shmuel Zaks - The Mathematician, Computer Scientist and Personality. [Citation Graph (, )][DBLP]
The Disagreement Power of an Adversary. [Citation Graph (, )][DBLP]
New Bounds for the Controller Problem. [Citation Graph (, )][DBLP]
On Set Consensus Numbers. [Citation Graph (, )][DBLP]
The Abstract MAC Layer. [Citation Graph (, )][DBLP]
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures. [Citation Graph (, )][DBLP]
Interrupting Snapshots and the JavaTM^{\mbox{\tiny TM}} Size() Method. [Citation Graph (, )][DBLP]
Elastic Transactions. [Citation Graph (, )][DBLP]
Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. [Citation Graph (, )][DBLP]
Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. [Citation Graph (, )][DBLP]
The RedBlue Adaptive Universal Constructions. [Citation Graph (, )][DBLP]
Help When Needed, But No More: Efficient Read/Write Partial Snapshot. [Citation Graph (, )][DBLP]
Contention-Sensitive Data Structures and Algorithms. [Citation Graph (, )][DBLP]
Brief Announcement: Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms. [Citation Graph (, )][DBLP]
Brief Announcement: Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset. [Citation Graph (, )][DBLP]
Local Computation of Nearly Additive Spanners. [Citation Graph (, )][DBLP]
A Local 2-Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (, )][DBLP]
Distributed Discovery of Large Near-Cliques. [Citation Graph (, )][DBLP]
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality. [Citation Graph (, )][DBLP]
Brief Announcement: Decidable Graph Languages by Mediated Population Protocols. [Citation Graph (, )][DBLP]
Brief Announcement: Towards Secured Distributed Polling in Social Networks. [Citation Graph (, )][DBLP]
What Can Be Observed Locally? [Citation Graph (, )][DBLP]
At-Most-Once Semantics in Asynchronous Shared Memory. [Citation Graph (, )][DBLP]
Nonblocking Algorithms and Backward Simulation. [Citation Graph (, )][DBLP]
Brief Announcement: Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction. [Citation Graph (, )][DBLP]
Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison. [Citation Graph (, )][DBLP]
Dynamics in Network Interaction Games. [Citation Graph (, )][DBLP]
Brief Announcement: Cloud Computing Games: Pricing Services of Large Data Centers. [Citation Graph (, )][DBLP]
On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion. [Citation Graph (, )][DBLP]
Crash-Quiescent Failure Detection. [Citation Graph (, )][DBLP]
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity. [Citation Graph (, )][DBLP]
Brief Announcement: On Implementing Omega Efficiently in the Crash-Recovery Model. [Citation Graph (, )][DBLP]
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems. [Citation Graph (, )][DBLP]
Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. [Citation Graph (, )][DBLP]
Brief Announcement Zab: A Practical Totally Ordered Broadcast Protocol. [Citation Graph (, )][DBLP]
Compact Multicast Routing. [Citation Graph (, )][DBLP]
Compact Routing in Power-Law Graphs. [Citation Graph (, )][DBLP]
Virtual Ring Routing Trends. [Citation Graph (, )][DBLP]
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. [Citation Graph (, )][DBLP]
Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]
Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle. [Citation Graph (, )][DBLP]
On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement. [Citation Graph (, )][DBLP]
From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n3/2) Bits. [Citation Graph (, )][DBLP]
Brief Announcement: A Leader-free Byzantine Consensus Algorithm. [Citation Graph (, )][DBLP]
Efficient k-Shot Broadcasting in Radio Networks. [Citation Graph (, )][DBLP]
Keeping Mobile Robot Swarms Connected. [Citation Graph (, )][DBLP]
Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]
Brief Announcement: Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. [Citation Graph (, )][DBLP]
|