## Calendar

| Tuesday, 10 October 2017 |

### Week 5: quiz

12:00

We have defined the LOCAL model so that the unique identifiers are at most polynomial in n.

(a) Mention one example of an algorithm in which this assumption is important (and e.g. unbounded identifiers would be bad).

(b) Mention one example of an algorithm in which this assumption is not needed at all (and e.g. unbounded identifiers would be just fine).