On the round complexity of Byzantine agreement without initial set-up

It is well known that in order to (deterministically) achieve Byzantine agreement (consensus) among n processors in a fully connected network in which f processors may be faulty, where f satisfies f