|
Conferences in DBLP
The Mailbox Problem. [Citation Graph (, )][DBLP]
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems. [Citation Graph (, )][DBLP]
How to Solve Consensus in the Smallest Window of Synchrony. [Citation Graph (, )][DBLP]
Local Terminations and Distributed Computability in Anonymous Networks. [Citation Graph (, )][DBLP]
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring. [Citation Graph (, )][DBLP]
Fast Distributed Approximations in Planar Graphs. [Citation Graph (, )][DBLP]
Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion. [Citation Graph (, )][DBLP]
The Weakest Failure Detector for Message Passing Set-Agreement. [Citation Graph (, )][DBLP]
Local Maps: New Insights into Mobile Agent Algorithms. [Citation Graph (, )][DBLP]
r3: Resilient Random Regular Graphs. [Citation Graph (, )][DBLP]
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics. [Citation Graph (, )][DBLP]
Constant-Space Localized Byzantine Consensus. [Citation Graph (, )][DBLP]
Optimistic Erasure-Coded Distributed Storage. [Citation Graph (, )][DBLP]
On the Emulation of Finite-Buffered Output Queued Switches Using Combined Input-Output Queuing. [Citation Graph (, )][DBLP]
On Radio Broadcasting in Random Geometric Graphs. [Citation Graph (, )][DBLP]
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens. [Citation Graph (, )][DBLP]
Deterministic Rendezvous in Trees with Little Memory. [Citation Graph (, )][DBLP]
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information. [Citation Graph (, )][DBLP]
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP]
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. [Citation Graph (, )][DBLP]
Permissiveness in Transactional Memories. [Citation Graph (, )][DBLP]
The Synchronization Power of Coalesced Memory Accesses. [Citation Graph (, )][DBLP]
Optimizing Threshold Protocols in Adversarial Structures. [Citation Graph (, )][DBLP]
Hopscotch Hashing. [Citation Graph (, )][DBLP]
Computing Lightweight Spanners Locally. [Citation Graph (, )][DBLP]
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension. [Citation Graph (, )][DBLP]
Leveraging Linial's Locality Limit. [Citation Graph (, )][DBLP]
Continuous Consensus with Failures and Recoveries. [Citation Graph (, )][DBLP]
No Double Discount: Condition-Based Simultaneity Yields Limited Gain. [Citation Graph (, )][DBLP]
Bosco: One-Step Byzantine Asynchronous Consensus. [Citation Graph (, )][DBLP]
A Limit to the Power of Multiple Nucleation in Self-assembly. [Citation Graph (, )][DBLP]
Using Bounded Model Checking to Verify Consensus Algorithms. [Citation Graph (, )][DBLP]
Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks. [Citation Graph (, )][DBLP]
Brief Announcement: On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots. [Citation Graph (, )][DBLP]
The Dynamics of Probabilistic Population Protocols. [Citation Graph (, )][DBLP]
A Distributed Algorithm for Computing and Updating the Process Number of a Forest. [Citation Graph (, )][DBLP]
Brief Announcment: Corruption Resilient Fountain Codes. [Citation Graph (, )][DBLP]
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks. [Citation Graph (, )][DBLP]
Easy Consensus Algorithms for the Crash-Recovery Model. [Citation Graph (, )][DBLP]
Evaluating the Quality of a Network Topology through Random Walks. [Citation Graph (, )][DBLP]
Brief Announcement: Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems. [Citation Graph (, )][DBLP]
Data Failures. [Citation Graph (, )][DBLP]
Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network. [Citation Graph (, )][DBLP]
Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model. [Citation Graph (, )][DBLP]
|