The following pages link to (Q3504346):
Displayed 5 items.
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Election and rendezvous with incomparable labels (Q930904) (← links)
- Election in partially anonymous networks with arbitrary knowledge in message passing systems (Q1938371) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)