Pages that link to "Item:Q2942761"
From MaRDI portal
The following pages link to Computing anonymously with arbitrary knowledge (Q2942761):
Displaying 19 items.
- Topology recognition with advice (Q259077) (← links)
- 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)
- On the round complexity of Byzantine agreement without initial set-up (Q1044183) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
- Activating anonymous ad hoc radio networks (Q1954211) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Efficient algorithms for anonymous Byzantine agreement (Q2480748) (← 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)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Almost universal anonymous rendezvous in the plane (Q6046947) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
