On the public citation graph

Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony

0 signed · 73 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/11561927_16openalex-snapshot
Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Links
inferredcites →https://doi.org/10.1007/978-3-642-79789-7_8openalex-snapshot
Failure Mode Assumptions and Assumption Coverage
inferredcites →https://doi.org/10.1007/s004460050032openalex-snapshot
Early consensus in an asynchronous system with a weak failure detector
inferredcites →https://doi.org/10.1007/s004460100061openalex-snapshot
Handling message semantics with Generic Broadcast protocols
inferredcites →https://doi.org/10.1016/j.ipl.2006.05.009openalex-snapshot
Implementing unreliable failure detectors with unknown membership
inferredcites →https://doi.org/10.1016/j.jcss.2003.08.003openalex-snapshot
A necessary and sufficient condition for transforming limited accuracy failure detectors
inferredcites →https://doi.org/10.1016/j.jpdc.2006.06.002openalex-snapshot
From ⋄ W to Ω : A simple bounded quiescent reliable broadcast-based transformation
inferredcites →https://doi.org/10.1016/s0020-0190(98)00122-7openalex-snapshot
Reducing Ω to ◊
inferredcites →https://doi.org/10.1109/12.980014openalex-snapshot
On the quality of service of failure detectors
inferredcites →https://doi.org/10.1109/dsn.2003.1209946openalex-snapshot
Asynchronous implementation of failure detectors
inferredcites →https://doi.org/10.1109/dsn.2005.37openalex-snapshot
Definition and Specification of Accrual Failure Detectors
inferredcites →https://doi.org/10.1109/dsn.2006.34openalex-snapshot
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
inferredcites →https://doi.org/10.1109/prdc.2000.897283openalex-snapshot
Low cost consensus-based Atomic Broadcast
inferredcites →https://doi.org/10.1109/prdc.2001.992691openalex-snapshot
An adaptive failure detection protocol
inferredcites →https://doi.org/10.1109/reldi.2000.885392openalex-snapshot
Optimal implementation of the weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1109/reldis.2004.1353022openalex-snapshot
Crash-resilient time-free eventual leadership
inferredcites →https://doi.org/10.1109/reldis.2005.19openalex-snapshot
From Static Distributed Systems to Dynamic Systems
inferredcites →https://doi.org/10.1109/srds.2006.9openalex-snapshot
An SNMP based failure detection service
inferredcites →https://doi.org/10.1109/tc.2004.1268403openalex-snapshot
The information structure of indulgent consensus
inferredcites →https://doi.org/10.1109/tc.2004.33openalex-snapshot
On the implementation of unreliable failure detectors in partially synchronous systems
inferredcites →https://doi.org/10.1109/tdsc.2008.24openalex-snapshot
Chasing the Weakest System Model for Implementing Ω and Consensus
inferredcites →https://doi.org/10.1109/tpds.2006.95openalex-snapshot
Time-free and timer-based assumptions can be combined to obtain eventual leadership
inferredcites →https://doi.org/10.1142/s0129626401000452openalex-snapshot
LEADER-BASED CONSENSUS
inferredcites →https://doi.org/10.1142/s0129626406002575openalex-snapshot
A TIME-FREE ASSUMPTION TO IMPLEMENT EVENTUAL LEADERSHIP
inferredcites →https://doi.org/10.1145/1011767.1011816openalex-snapshot
Communication-efficient leader election and consensus with limited link synchrony
inferredcites →https://doi.org/10.1145/1052796.1052806openalex-snapshot
A short introduction to failure detectors for asynchronous distributed systems
inferredcites →https://doi.org/10.1145/164051.164056openalex-snapshot
Immediate atomic snapshots and fast renaming
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/277697.277755openalex-snapshot
Structured derivations of consensus algorithms for failure detectors
inferredcites →https://doi.org/10.1145/279227.279229openalex-snapshot
The part-time parliament
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/3335772.3335936openalex-snapshot
The Byzantine generals problem
inferredcites →https://doi.org/10.1145/343477.343630openalex-snapshot
Indulgent algorithms (preliminary version)
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/383962.384010openalex-snapshot
On scalable and efficient distributed failure detectors
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous environment
inferredcites →https://doi.org/10.1145/872035.872081openalex-snapshot
On implementing omega with weak reliability and synchrony assumptions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11945529_28openalex-snapshot
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_140openalex-snapshot
Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_140openalex-snapshot
Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-319-11197-1_26openalex-snapshot
Hierarchical Eventual Leader Election for Dynamic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-49259-9_6openalex-snapshot
Packet Efficient Implementation of the Omega Failure Detector
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_14openalex-snapshot
From an Intermittent Rotating Star to a Leader
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_5openalex-snapshot
With Finite Memory Consensus Is Easier Than Reliable Broadcast
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.10.011openalex-snapshot
A simple and communication-efficient Omega algorithm in the crash-recovery model
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.010openalex-snapshot
Communication-optimal eventually perfect failure detection in partially synchronous systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.09.004openalex-snapshot
Stabilizing leader election in partial synchronous systems with crash failures
inferred← citeshttps://doi.org/10.1016/j.jss.2011.06.019openalex-snapshot
Communication-efficient leader election in crash–recovery systems
inferred← citeshttps://doi.org/10.1080/17445760.2012.753180openalex-snapshot
Implementing the weakest failure detector for solving the consensus problem
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493575openalex-snapshot
Electing a leader in the local computation model using mobile agents
inferred← citeshttps://doi.org/10.1109/aina.2007.38openalex-snapshot
Anonymous Stabilizing Leader Election using a Network Sequencer
inferred← citeshttps://doi.org/10.1109/dsn.2007.55openalex-snapshot
How to Choose a Timing Model?
inferred← citeshttps://doi.org/10.1109/dsn.2008.4630089openalex-snapshot
A robust and lightweight stable leader election service for dynamic systems
inferred← citeshttps://doi.org/10.1109/edcc.2010.24openalex-snapshot
Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency
inferred← citeshttps://doi.org/10.1109/nbis.2011.43openalex-snapshot
Specifying and Implementing an Eventual Leader Service for Dynamic Systems
inferred← citeshttps://doi.org/10.1109/nca.2007.19openalex-snapshot
Eventual Leader Service in Unreliable Asynchronous Systems: Why? How?
inferred← citeshttps://doi.org/10.1109/pdp.2013.33openalex-snapshot
An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems
inferred← citeshttps://doi.org/10.1109/prdc.2006.44openalex-snapshot
Minimal System Conditions to Implement Unreliable Failure Detectors
inferred← citeshttps://doi.org/10.1109/prdc.2008.10openalex-snapshot
Eventual Leader Election in the Crash-Recovery Failure Model
inferred← citeshttps://doi.org/10.1109/prdc.2009.58openalex-snapshot
Quiescent Leader Election in Crash-Recovery Systems
inferred← citeshttps://doi.org/10.1109/srds.2008.19openalex-snapshot
Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols
inferred← citeshttps://doi.org/10.1109/tpds.2008.16openalex-snapshot
How to Choose a Timing Model
inferred← citeshttps://doi.org/10.1109/tpds.2009.163openalex-snapshot
From an Asynchronous Intermittent Rotating Star to an Eventual Leader
inferred← citeshttps://doi.org/10.1145/1281100.1281152openalex-snapshot
From an intermittent rotating star to a leader
inferred← citeshttps://doi.org/10.1145/1416729.1416777openalex-snapshot
Agreement and consistency without knowing the number of processes
inferred← citeshttps://doi.org/10.1145/1416729.1416792openalex-snapshot
Agreement without knowing everybody
inferred← citeshttps://doi.org/10.1504/ijwgs.2012.049167openalex-snapshot
Specifying and implementing an eventual leader service for dynamic systems
inferred← citeshttps://doi.org/10.2200/s00236ed1v01y201004dct002openalex-snapshot
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.5753/wtf.2014.22951openalex-snapshot
Serviço de Líder em Sistemas Dinâmicos com Memória Compartilhada
inferred← citeshttps://doi.org/10.70675/f2b08af0z087dz4606zb83bzfebc42fc84a9openalex-snapshot
Eventual Leader Elections in Dynamic Networks
showing the first 33 of 34 · page through all 34
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.