From joel@.MISSING-HOST-NAME. Wed Feb 6 12:49:34 2002 Date: Wed, 6 Feb 2002 11:57:58 -0500 (EST) From: Joel Seiferas To: CSC484 Subject: Hint Here's a useful lemma: We can convert any asynchronous algorithm to a synchronous one with the same message bound, and with every round ``active'' (i.e., producing at least one message). (For which exercise is this a hint? To use it, you have both to explain why it is true and to solve the exercise assuming it.)