This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...