Pages that link to "Item:Q5321679"
From MaRDI portal
The following pages link to Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures (Q5321679):
Displaying 23 items.
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Mediated population protocols (Q533894) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- Homonym population protocols (Q722223) (← links)
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks (Q740980) (← links)
- Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
- Terminating distributed construction of shapes and patterns in a fair solution of automata (Q1656881) (← links)
- On space complexity of self-stabilizing leader election in mediated population protocol (Q1938386) (← links)
- Clocked population protocols (Q2040025) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Simple and fast approximate counting and leader election in populations (Q2139094) (← links)
- Population protocols with unreliable communication (Q2148893) (← links)
- Fault-tolerant simulation of population protocols (Q2220403) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Computing in social networks (Q2637316) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Protocols with constant local storage and unreliable communication (Q2699979) (← links)
- (Q3304110) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
- Fault tolerant network constructors (Q6044462) (← links)