Pages that link to "Item:Q5711520"
From MaRDI portal
The following pages link to SOFSEM 2005: Theory and Practice of Computer Science (Q5711520):
Displayed 8 items.
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6039418) (← links)