Pages that link to "Item:Q4887486"
From MaRDI portal
The following pages link to Computing functions on asynchronous anonymous networks (Q4887486):
Displaying 16 items.
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Leader election in plane cellular automata, only with left-right global convention (Q596068) (← links)
- Computing input multiplicity in anonymous synchronous networks with dynamic faults (Q876726) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- Symmetries and sense of direction in labeled graphs (Q1270775) (← links)
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths (Q1343157) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Labeled versus unlabeled distributed Cayley networks (Q1917232) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Distinguishing views in symmetric networks: a tight lower bound (Q2342668) (← links)
- Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? (Q2835014) (← links)
- Computing functions on asynchronous anonymous networks (Q4887486) (← links)
- Universal dynamic synchronous self-stabilization (Q5138377) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Certain subgroups of fundamental group of graphs (Q6672055) (← links)
