On the public citation graph
Time is not a healer
0 signed · 177 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.
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.
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/bf01667080openalex-snapshot
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
inferredcites →https://doi.org/10.1007/bf01667081openalex-snapshot
Connectivity requirements for Byzantine agreement under restricted types of failures
inferredcites →https://doi.org/10.1016/0020-0190(87)90052-4openalex-snapshot
Extended impossibility results for asynchronous complete networks
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/s0019-9958(82)90776-8openalex-snapshot
An efficient algorithm for byzantine agreement without authentication
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.1109/tse.1986.6312888openalex-snapshot
Distributed agreement in the presence of processor and communication faults
inferredcites →https://doi.org/10.1137/0212045openalex-snapshot
Authenticated Algorithms for Byzantine Agreement
inferredcites →https://doi.org/10.1145/22145.22182openalex-snapshot
The distributed firing squad problem
inferredcites →https://doi.org/10.1145/2402.322398openalex-snapshot
The Weak Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/2455.2457openalex-snapshot
Synchronizing clocks in the presence of faults
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/800057.808720openalex-snapshot
On the possibility and impossibility of achieving clock synchronization
inferredcites →https://doi.org/10.1145/800222.806739openalex-snapshot
Fault-tolerant clock synchronization
inferredcites →https://doi.org/10.21236/ada154770openalex-snapshot
The Byzantine Firing Squad Problem.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0470072644openalex-snapshot
Design and Analysis of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/11429647_21openalex-snapshot
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
inferred← citeshttps://doi.org/10.1007/11780823_16openalex-snapshot
On Fractional Dynamic Faults with Threshold
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_85openalex-snapshot
Distributed function evaluation in the presence of transmission faults
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_169openalex-snapshot
Distributed computing in asynchronous networks with byzantine edges
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_13openalex-snapshot
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_27openalex-snapshot
Mobile Robots with Uncertain Visibility Sensors
inferred← citeshttps://doi.org/10.1007/978-3-030-50086-3_8openalex-snapshot
Derivation of Heard-of Predicates from Elementary Behavioral Patterns
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_3openalex-snapshot
Invited Talk: Resilient Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_11openalex-snapshot
Round-Oblivious Stabilizing Consensus in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-91081-5_2openalex-snapshot
Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_8openalex-snapshot
Blockchain in Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_3openalex-snapshot
About Informatics, Distributed Computing, and Our Job: A Personal View
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_16openalex-snapshot
Disconnected Agreement in Networks Prone to Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_6openalex-snapshot
Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_31openalex-snapshot
Consensus Through Knot Discovery in Asynchronous Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_26openalex-snapshot
Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_3openalex-snapshot
A Characterization of Dynamic Networks Where Consensus Is Solvable
inferred← citeshttps://doi.org/10.1007/978-3-319-03850-6_17openalex-snapshot
Mobile Byzantine Agreement on Arbitrary Network
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_4openalex-snapshot
Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_7openalex-snapshot
Iterative Approximate Consensus in the Presence of Byzantine Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_2openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_12openalex-snapshot
Cutoff Bounds for Consensus Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-92402-1_2openalex-snapshot
A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality
inferred← citeshttps://doi.org/10.1007/978-3-540-45214-0_29openalex-snapshot
On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_11openalex-snapshot
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_42openalex-snapshot
On the Power of Impersonation Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_4openalex-snapshot
Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_28openalex-snapshot
Continuous Consensus with Failures and Recoveries
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_32openalex-snapshot
Using Bounded Model Checking to Verify Consensus Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_10openalex-snapshot
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-11294-2_3openalex-snapshot
Modular Approach to Replication for Availability
inferred← citeshttps://doi.org/10.1007/978-3-642-22212-2_4openalex-snapshot
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_7openalex-snapshot
Agreement in Directed Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_16openalex-snapshot
Asynchrony from Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_14openalex-snapshot
Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_10openalex-snapshot
A Logic-Based Framework for Verifying Consensus Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-54848-2_14openalex-snapshot
What Can be Computed in a Distributed System?
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_6openalex-snapshot
Tight Bound on Mobile Byzantine Agreement
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/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s00446-006-0017-6openalex-snapshot
The overhead of consensus failure recovery
inferred← citeshttps://doi.org/10.1007/s00446-007-0026-0openalex-snapshot
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
inferred← citeshttps://doi.org/10.1007/s00446-008-0056-2openalex-snapshot
Consensus and collision detectors in radio networks
inferred← citeshttps://doi.org/10.1007/s00446-009-0084-6openalex-snapshot
The Heard-Of model: computing in distributed systems with benign faults
inferred← citeshttps://doi.org/10.1007/s00446-010-0116-2openalex-snapshot
Randomization can be a healer: consensus with dynamic omission failures
inferred← citeshttps://doi.org/10.1007/s00446-013-0199-7openalex-snapshot
Tolerating permanent and transient value faults
inferred← citeshttps://doi.org/10.1007/s00446-019-00348-0openalex-snapshot
Consensus in rooted dynamic networks with short-lived stability
inferred← citeshttps://doi.org/10.1007/s00446-021-00392-9openalex-snapshot
MinMax algorithms for stabilizing consensus
inferred← citeshttps://doi.org/10.1007/s00446-024-00468-2openalex-snapshot
Iterative approximate Byzantine consensus in arbitrary directed graphs
inferred← citeshttps://doi.org/10.1007/s00446-026-00517-yopenalex-snapshot
Non-uniform content-oblivious leader election in 2-edge-connected networks
inferred← citeshttps://doi.org/10.1007/s00453-024-01209-4openalex-snapshot
The Time Complexity of Consensus Under Oblivious Message Adversaries
inferred← citeshttps://doi.org/10.1016/c2011-0-07032-1openalex-snapshot
Distributed Computing Through Combinatorial Topology
inferred← citeshttps://doi.org/10.1016/j.dam.2020.02.013openalex-snapshot
On the radius of nonsplit graphs and information dissemination in dynamic networks
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.001openalex-snapshot
On the impact of link faults on Byzantine agreement
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.07.017openalex-snapshot
Probabilistic and temporal failure detectors for solving distributed problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.04.036openalex-snapshot
Agreement in synchronous networks with ubiquitous faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.032openalex-snapshot
Synchronous consensus under hybrid process and link failures
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.022openalex-snapshot
A simple characterization of asynchronous computations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.024openalex-snapshot
A characterization of oblivious message adversaries for which Consensus is solvable
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.019openalex-snapshot
Tight bound on mobile Byzantine Agreement
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.019openalex-snapshot
Gracefully degrading consensus and k -set agreement in directed dynamic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.020openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00100-3openalex-snapshot
A simple bivalency proof that t-resilient consensus requires t+1 rounds
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80835-1openalex-snapshot
A Note on Set Agreement with Omission Failures1 1This work is partially supported by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation under grant number 5005-67322.
inferred← citeshttps://doi.org/10.1017/s0960129521000037openalex-snapshot
Back to the Coordinated Attack Problem
inferred← citeshttps://doi.org/10.1109/apsec.2009.23openalex-snapshot
Towards Automated Verification of Distributed Consensus Protocols
inferred← citeshttps://doi.org/10.1109/depend.2010.9openalex-snapshot
Randomized Consensus in Wireless Environments: A Case Where More is Better
inferred← citeshttps://doi.org/10.1109/dsn.2007.25openalex-snapshot
Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults
inferred← citeshttps://doi.org/10.1109/dsn.2010.5544268openalex-snapshot
Turquois: Byzantine consensus in wireless ad hoc networks
inferred← citeshttps://doi.org/10.1109/dsnw.2013.6615529openalex-snapshot
On reliability analysis of leader election protocols for virtual traffic lights
inferred← citeshttps://doi.org/10.1109/edcc.2014.26openalex-snapshot
On Probabilistic Analysis of Disagreement in Synchronous Consensus Protocols
inferred← citeshttps://doi.org/10.1109/edcc.2015.29openalex-snapshot
On the Probability of Unsafe Disagreement in Group Formation Algorithms for Vehicular Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2016.109openalex-snapshot
A Look at Basics of Distributed Computing
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00103openalex-snapshot
Exact Consensus under Global Asymmetric Byzantine Links
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00021openalex-snapshot
Fault-tolerant Consensus in Anonymous Dynamic Network
inferred← citeshttps://doi.org/10.1109/icdcsw.2005.120openalex-snapshot
Reconciling the Theory and Practice of (Un)Reliable Wireless Broadcast
inferred← citeshttps://doi.org/10.1109/icsc65596.2025.11140282openalex-snapshot
Consensus-driven Intrusion Detection Systems: Enhancing Performance and Fault-tolerance using Approximate Consensus
inferred← citeshttps://doi.org/10.1109/ipdps.2011.301openalex-snapshot
Solving k-Set Agreement with Stable Skeleton Graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2016.92openalex-snapshot
Never Say Never -- Probabilistic and Temporal Failure Detectors
inferred← citeshttps://doi.org/10.1109/nca67271.2025.00030openalex-snapshot
Rûm: Multivalued Loss-Tolerant Byzantine Consensus for Mobile Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1109/prdc.2005.10openalex-snapshot
A Note on a Simple Equivalence between Round-based Synchronous and Asynchronous Models
inferred← citeshttps://doi.org/10.1109/prdc.2006.39openalex-snapshot
Improving Fast Paxos: being optimistic with no overhead
inferred← citeshttps://doi.org/10.1109/prdc.2008.13openalex-snapshot
Language and Tool Support for Model Checking of Fault-Tolerant Distributed Algorithms
inferred← citeshttps://doi.org/10.1109/prdc.2013.13openalex-snapshot
Probabilistic Analysis of a 1-of-n Selection Algorithm Using a Moderately Pessimistic Decision Criterion
inferred← citeshttps://doi.org/10.1109/prdc.2017.56openalex-snapshot
A Probabilistic Analysis of a Leader Election Protocol for Virtual Traffic Lights
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180178openalex-snapshot
A unified proof of minimum time complexity for reaching consensus and uniform consensus - an oracle-based approach
inferred← citeshttps://doi.org/10.1109/srds.2007.20openalex-snapshot
Model Checking of Consensus Algorit
inferred← citeshttps://doi.org/10.1109/srds.2008.21openalex-snapshot
Extending Paxos/LastVoting with an Adequate Communication Layer for Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/srds.2018.00021openalex-snapshot
RATCHETA: Memory-Bounded Hybrid Byzantine Consensus for Cooperative Embedded Systems
inferred← citeshttps://doi.org/10.1109/tc.2023.3238138openalex-snapshot
Efficient Fault-Tolerant Consensus for Collaborative Services in Edge Computing
inferred← citeshttps://doi.org/10.1109/tc.2024.3506856openalex-snapshot
Nicaea: A Byzantine Fault Tolerant Consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed Computing
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3462680openalex-snapshot
Byzantine Fault Tolerant Consensus in Open Wireless Networks via an Abstract MAC Layer
inferred← citeshttps://doi.org/10.1109/tdsc.2008.24openalex-snapshot
Chasing the Weakest System Model for Implementing Ω and Consensus
inferred← citeshttps://doi.org/10.1109/tdsc.2011.48openalex-snapshot
Quantitative Analysis of Consensus Algorithms
inferred← citeshttps://doi.org/10.1109/tmc.2012.225openalex-snapshot
Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1137/s0097539799364006openalex-snapshot
A Layered Analysis of Consensus
inferred← citeshttps://doi.org/10.1142/s012962642150002xopenalex-snapshot
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds
inferred← citeshttps://doi.org/10.1145/1073814.1073850openalex-snapshot
Consensus and collision detectors in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1145/1146381.1146408openalex-snapshot
Timeliness, failure-detectors, and consensus performance
inferred← citeshttps://doi.org/10.1145/1233481.1233496openalex-snapshot
Harmful dogmas in fault tolerant distributed computing
inferred← citeshttps://doi.org/10.1145/1250790.1250814openalex-snapshot
Tight bounds for asynchronous randomized consensus
inferred← citeshttps://doi.org/10.1145/1281100.1281136openalex-snapshot
Tolerating corrupted communication
inferred← citeshttps://doi.org/10.1145/1411509.1411510openalex-snapshot
Tight bounds for asynchronous randomized consensus
inferred← citeshttps://doi.org/10.1145/1462187.1462191openalex-snapshot
Optimal message-driven implementations of omega with mute processes
inferred← citeshttps://doi.org/10.1145/1993806.1993808openalex-snapshot
Coordinated consensus in dynamic networks
inferred← citeshttps://doi.org/10.1145/2245276.2245371openalex-snapshot
Timeout-based adaptive consensus
inferred← citeshttps://doi.org/10.1145/2484239.2484249openalex-snapshot
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
inferred← citeshttps://doi.org/10.1145/2767386.2767441openalex-snapshot
Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1145/277697.277720openalex-snapshot
The unified structure of consensus
inferred← citeshttps://doi.org/10.1145/2833312.2833323openalex-snapshot
Fast consensus under eventually stabilizing message adversaries
inferred← citeshttps://doi.org/10.1145/3293611.3331624openalex-snapshot
Topological Characterization of Consensus under General Message Adversaries
inferred← citeshttps://doi.org/10.1145/3364626.3364635openalex-snapshot
The Splendors and Miseries of Rounds
inferred← citeshttps://doi.org/10.1145/3428278openalex-snapshot
Testing consensus implementations using communication closure
inferred← citeshttps://doi.org/10.1145/3485242openalex-snapshot
Tight Bounds for Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.1145/3519270.3538460openalex-snapshot
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
inferred← citeshttps://doi.org/10.1145/3583668.3594578openalex-snapshot
Distributed CONGEST Algorithms against Mobile Adversaries
inferred← citeshttps://doi.org/10.1145/3662158.3664932openalex-snapshot
Keynote: Time is not a Healer: Before and After
inferred← citeshttps://doi.org/10.1145/3732772.3733536openalex-snapshot
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
inferred← citeshttps://doi.org/10.1145/504192.504195openalex-snapshot
On the cost of fault-tolerant consensus when there are no faults
inferred← citeshttps://doi.org/10.1145/954092.954102openalex-snapshot
ACM SIGACT news distributed computing column 13
inferred← citeshttps://doi.org/10.15308/sinteza-2018-131-138openalex-snapshot
Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto
inferred← citeshttps://doi.org/10.15439/2021f38openalex-snapshot
Bernoulli Meets PBFT: Modeling BFT Protocols in the Presence of Dynamic Failures
inferred← citeshttps://doi.org/10.3390/e24030333openalex-snapshot
Simple Majority Consensus in Networks with Unreliable Communication
inferred← citeshttps://doi.org/10.3929/ethz-a-005920166openalex-snapshot
Algorithmic solutions for transient faults in communication networks: On swap edges and local algorithms
inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.47openalex-snapshot
Bounds on Worst-Case Responsiveness for Agreement Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.23openalex-snapshot
Broadcast CONGEST Algorithms against Adversarial Edges
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.24openalex-snapshot
General CONGEST Compilers against Adversarial Edges
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.9openalex-snapshot
ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication
inferred← citeshttps://doi.org/10.4230/lipics.sand.2025.9openalex-snapshot
Finding Structure in Dynamic Networks
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:26)2021openalex-snapshot
Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models
inferred← citeshttps://doi.org/10.48550/arxiv.1204.0641openalex-snapshot
Agreement in Directed Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3839openalex-snapshot
Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms
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.1501.02716openalex-snapshot
Gracefully Degrading Consensus and $k$-Set Agreement in Directed Dynamic Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1508.00851openalex-snapshot
Fast Consensus under Eventually Stabilizing Message Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06583openalex-snapshot
Global Synchronization and Consensus Using Beeps in a Fault-Prone MAC
inferred← citeshttps://doi.org/10.48550/arxiv.1511.08232openalex-snapshot
Beyond One Third Byzantine Failures
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04222openalex-snapshot
Amortized Averaging Algorithms for Approximate Consensus
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02279openalex-snapshot
Synchronous Hybrid Message-Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1608.07923openalex-snapshot
Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1805.04923openalex-snapshot
Fast Multidimensional Asymptotic and Approximate Consensus
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4839openalex-snapshot
Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5975openalex-snapshot
Abstractions for Solving Consensus and Related Problems with Byzantine Faults
inferred← citeshttps://doi.org/10.70675/6d6c196bz040bz443bzb25az79931ece7fe1openalex-snapshot
Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing
inferred← citeshttps://doi.org/10.70675/6dbf4846zabebz4214z9c69z72df981640bdopenalex-snapshot
On the Power of Rounds : Explorations of the Heard-Of Model
inferred← citeshttps://doi.org/10.70675/8dd7148fza34ez4596z8ceaz55b6ecde9061openalex-snapshot
Accords exacts et approchés pour les adversaires de message
inferred← citeshttps://doi.org/10.70675/9c25b337z7b59z4d69z8a2azf1601341b9c0openalex-snapshot
Achieving accountability, reconfiguration, randomness, and secret leadership in byzantine fault tolerant distributed systems
inferred← citeshttps://doi.org/10.70675/b7d13eb6z6e96z412eza867zeac55275a60eopenalex-snapshot
Foundations of reliable cooperation under asynchrony, Byzantine faults, and message adversaries
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.