The following pages link to Avery Miller (Q251300):
Displaying 18 items.
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- Fast rendezvous with advice (Q896137) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- Buffer size for routing limited-rate adversarial traffic (Q1660943) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks (Q1796441) (← links)
- Fast Byzantine gathering with visibility in graphs (Q2037833) (← links)
- Global synchronization and consensus using beeps in a fault-prone multiple access channel (Q2285154) (← links)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Burning Two Worlds (Q3297761) (← links)
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4575621) (← links)
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4962669) (← links)
- With Great Speed Come Small Buffers (Q5145189) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Time versus cost tradeoffs for deterministic rendezvous in networks (Q6483581) (← links)
- Reconfiguration of multisets with applications to bin packing (Q6575396) (← links)
- Cops and robbers on 1-planar graphs (Q6618244) (← links)
