Pages that link to "Item:Q4521525"
From MaRDI portal
The following pages link to The Las-Vegas Processor Identity Problem (How and When to Be Unique) (Q4521525):
Displaying 10 items.
- Space efficient processor identity protocol (Q910199) (← links)
- The processor identity problem (Q917266) (← links)
- On the smallest grain of salt to get a unique identity (Q1742759) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- Relationships between broadcast and shared memory in reliable anonymous distributed systems (Q1953650) (← links)
- Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
- The computational power of population protocols (Q1954251) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms (Q3300814) (← links)
- Naming symmetric processes using shared variables (Q5136976) (← links)