Pages that link to "Item:Q3361868"
From MaRDI portal
The following pages link to Better computing on the anonymous ring (Q3361868):
Displaying 15 items.
- Anonymous meeting in networks (Q262278) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Broadcasting in unlabeled hypercubes with a linear number of messages. (Q2583557) (← links)
- Computing functions on asynchronous anonymous networks (Q4887486) (← links)
- Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Distributed tree comparison with nodes of limited memory (Q5326772) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
