Work

Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees

Year: 2025

Type: conference-paper

Abstract: Approximate Agreement (AA) is a key consensus primitive that allows honest parties to achieve close but not necessarily identical outputs, even in the presence of Byzantine faults. While optimal round complexity for synchronous AA on real values is well understood, its extension to other input spaces remains an open problem.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733555

Authors: Marc Fuchs, Diana Ghinea, Zahra Parsaeian

Institutions: University of Freiburg, Lucerne University of Applied Sciences and Arts

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4411277515

FWCI: 1.303

Cites: 16

Cited by: 1

Related to: 10