Abstract
Approximate Agreement (AA) allows a set of n parties that start with real-valued inputs to obtain values that are at most within a parameter > 0 from each other and within the range of their inputs. Existing AA protocols, both for the synchronous network model (where any message is delivered within a known delay Δtime) and the asynchronous network model, are secure when up to t
Author supplied keywords
Cite
CITATION STYLE
Ghinea, D., Liu-Zhang, C. D., & Wattenhofer, R. (2022). Optimal Synchronous Approximate Agreement with Asynchronous Fallback. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 70–80). Association for Computing Machinery. https://doi.org/10.1145/3519270.3538442
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.