The following pages link to Janna Burman (Q521822):
Displaying 20 items.
- (Q391991) (redirect page) (← links)
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example (Q391993) (← links)
- Exclusive graph searching (Q521823) (← links)
- A self-stabilizing transformer for population protocols with covering (Q555304) (← links)
- Space-optimal counting in population protocols (Q1664170) (← links)
- On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols (Q2007882) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- Optimal multi-broadcast with beeps using group testing (Q2303283) (← links)
- Exclusive Graph Searching (Q2849309) (← links)
- (Q3174936) (← links)
- Time Optimal Asynchronous Self-stabilizing Spanning Tree (Q3523201) (← links)
- Self-stabilizing Distributed Stable Marriage (Q5045433) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- (Q5090911) (← links)
- On utilizing speed in networks of mobile agents (Q5176207) (← links)
- Brief Announcement (Q5197689) (← links)
- Brief Announcement (Q5197714) (← links)
- The Benefits of Entropy in Population Protocols. (Q5363812) (← links)
- Can Uncoordinated Beeps tell Stories? (Q5855265) (← links)
- Space-optimal naming in population protocols (Q6487526) (← links)
