Pages that link to "Item:Q2942760"
From MaRDI portal
The following pages link to Comparison of initial conditions for distributed algorithms on anonymous networks (Q2942760):
Displayed 11 items.
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms (Q3300814) (← links)
- Assigning labels in an unknown anonymous network with a leader (Q5138359) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks (Q6202242) (← links)