On the public citation graph

Asymptotically optimal algorithms for approximate agreement

https://doi.org/10.1007/bf01783662
0 signed · 76 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-12689-9_99openalex-snapshot
The consensus problem in unreliable distributed systems (a brief survey)
inferredcites →https://doi.org/10.1007/bf01762112openalex-snapshot
Programming simultaneous actions using common knowledge
inferredcites →https://doi.org/10.1016/0020-0190(82)90033-3openalex-snapshot
A lower bound for the time to assure interactive consistency
inferredcites →https://doi.org/10.1016/0196-6774(82)90004-9openalex-snapshot
The Byzantine generals strike again
inferredcites →https://doi.org/10.1016/0890-5401(88)90043-0openalex-snapshot
A new fault-tolerant algorithm for clock synchronization
inferredcites →https://doi.org/10.1016/0890-5401(90)90014-9openalex-snapshot
Knowledge and common knowledge in a Byzantine environment: Crash failures
inferredcites →https://doi.org/10.1016/0890-5401(91)90067-copenalex-snapshot
Simultaneity is harder than agreement
inferredcites →https://doi.org/10.1016/b978-0-934613-04-0.50013-2openalex-snapshot
Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures
inferredcites →https://doi.org/10.1016/s0019-9958(84)80033-9openalex-snapshot
An upper and lower bound for clock synchronization
inferredcites →https://doi.org/10.1145/10590.10596openalex-snapshot
A communication-efficient canonical form for fault-tolerant distributed protocols
inferredcites →https://doi.org/10.1145/2455.2457openalex-snapshot
Synchronizing clocks in the presence of faults
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/323596.323618openalex-snapshot
Inexact agreement
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/5925.5931openalex-snapshot
Reaching approximate agreement in the presence of faults
inferredcites →https://doi.org/10.1145/800222.806739openalex-snapshot
Fault-tolerant clock synchronization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1994.1094openalex-snapshot
Asynchronous Approximate Agreement
inferred← citeshttps://doi.org/10.1007/11561927_7openalex-snapshot
Musical Benches
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_6openalex-snapshot
Asynchronous Group Membership with Oracles
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_49openalex-snapshot
Optimal Approximate Agreement with Omission Faults
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_22openalex-snapshot
Byzantine Preferential Voting
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_6openalex-snapshot
Wait-Free Approximate Agreement on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-35260-7_1openalex-snapshot
TADA: A Toolkit for Approximate Distributed Agreement
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_10openalex-snapshot
Centroid Approximation with Multidimensional Approximate Agreement Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-21741-3_2openalex-snapshot
Reaching Approximate Byzantine Consensus with Multi-hop Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_29openalex-snapshot
Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_42openalex-snapshot
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-53426-7_30openalex-snapshot
Non-Bayesian Learning in the Presence of Byzantine Agents
inferred← citeshttps://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0056493openalex-snapshot
Approximate agreement with mixed mode faults: Algorithm and lower bound
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-014-0240-5openalex-snapshot
Multidimensional agreement in Byzantine systems
inferred← citeshttps://doi.org/10.1007/s00446-018-0336-4openalex-snapshot
Defending non-Bayesian learning against adversarial attacks
inferred← citeshttps://doi.org/10.1007/s004460050068openalex-snapshot
Computable obstructions to wait-free computability
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.003openalex-snapshot
Reaching approximate Byzantine consensus with multi-hop communication
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103175openalex-snapshot
TADA: A Toolkit for Approximate Distributed Agreement
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.06.001openalex-snapshot
Strong order-preserving renaming in the synchronous message passing model
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.08.001openalex-snapshot
Approximate Agreement under Mobile Byzantine Faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113733openalex-snapshot
Wait-free approximate agreement on graphs
inferred← citeshttps://doi.org/10.1080/1206212x.2003.11441711openalex-snapshot
Egophobic Voting Algorithms
inferred← citeshttps://doi.org/10.1109/12.888039openalex-snapshot
Exploiting omissive faults in synchronous approximate agreement
inferred← citeshttps://doi.org/10.1109/2.507632openalex-snapshot
Robust distributed computing and sensing algorithm
inferred← citeshttps://doi.org/10.1109/acc.2016.7526806openalex-snapshot
Multi-agent optimization in the presence of Byzantine adversaries: Fundamental limits
inferred← citeshttps://doi.org/10.1109/jsac.2013.130413openalex-snapshot
Resilient Asymptotic Consensus in Robust Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492673openalex-snapshot
Faster approximate agreement with multi-writer registers
inferred← citeshttps://doi.org/10.1109/srds.2018.00036openalex-snapshot
Byzantine Agreement with Interval Validity
inferred← citeshttps://doi.org/10.1109/tac.2020.3008139openalex-snapshot
Byzantine-Resilient Multiagent Optimization
inferred← citeshttps://doi.org/10.1109/ucc-companion.2018.00034openalex-snapshot
A Review of Adversarial Behaviour in Distributed Multi-Agent Optimisation
inferred← citeshttps://doi.org/10.1145/128733.128735openalex-snapshot
Tolerating failures of continuous-valued sensors
inferred← citeshttps://doi.org/10.1145/152610.152612openalex-snapshot
The consensus problem in fault-tolerant computing
inferred← citeshttps://doi.org/10.1145/179812.179902openalex-snapshot
Are wait-free algorithms fast?
inferred← citeshttps://doi.org/10.1145/235666.235671openalex-snapshot
Distributed computing column
inferred← citeshttps://doi.org/10.1145/2597630openalex-snapshot
Tight Bounds for Asynchronous Renaming
inferred← citeshttps://doi.org/10.1145/2933057.2933105openalex-snapshot
Fault-Tolerant Multi-Agent Optimization
inferred← citeshttps://doi.org/10.1145/3212734.3212762openalex-snapshot
Tight Bounds for Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.1145/3339471openalex-snapshot
Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
inferred← citeshttps://doi.org/10.1145/3485242openalex-snapshot
Tight Bounds for Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.1145/3519270.3538442openalex-snapshot
Optimal Synchronous Approximate Agreement with Asynchronous Fallback
inferred← citeshttps://doi.org/10.1145/3662158.3662782openalex-snapshot
Brief Announcement: Communication-Optimal Convex Agreement
inferred← citeshttps://doi.org/10.1145/3732772.3733551openalex-snapshot
Communication-Optimal Convex Agreement
inferred← citeshttps://doi.org/10.1145/3732772.3733555openalex-snapshot
Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees
inferred← citeshttps://doi.org/10.1145/3796701.3815918openalex-snapshot
Reaching Univalency with Subquadratic Communication
inferred← citeshttps://doi.org/10.15407/jnpae2002.01.117openalex-snapshot
Radioactive contamination spots' dynamics: identification problems
inferred← citeshttps://doi.org/10.21236/ada227140openalex-snapshot
Tolerating Failures of Continuous-Valued Sensors
inferred← citeshttps://doi.org/10.2200/s00918ed1v01y201904dct016openalex-snapshot
Network Topology and Fault-Tolerant Consensus
inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.29openalex-snapshot
Byzantine Approximate Agreement on Graphs
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2022.22openalex-snapshot
The Impossibility of Approximate Agreement on a Larger Class of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0620openalex-snapshot
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01845openalex-snapshot
Byzantine Multi-Agent Optimization: Part II
inferred← citeshttps://doi.org/10.48550/arxiv.1509.01864openalex-snapshot
Fault-Tolerant Multi-Agent Optimization: Part III
inferred← citeshttps://doi.org/10.48550/arxiv.1511.01821openalex-snapshot
Fault-Tolerant Distributed Optimization (Part IV): Constrained Optimization with Arbitrary Directed Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1803.02720openalex-snapshot
Byzantine Preferential Voting
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04923openalex-snapshot
Fast Multidimensional Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5447openalex-snapshot
Randomized versus Deterministic Implementations of Concurrent Data Structures
inferred← citeshttps://doi.org/10.70675/a9b17839z3659z470ez8e34zbb033848b575openalex-snapshot
Building distributed computing abstractions in the presence of mobile byzantine failures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.