On the public citation graph

Improving Fast Paxos: being optimistic with no overhead

https://doi.org/10.1109/prdc.2006.39
0 signed · 38 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-36080-8_5openalex-snapshot
Solving Agreement Problems with Weak Ordering Oracles
inferredcites →https://doi.org/10.1007/3-540-37795-6_4openalex-snapshot
Lower Bounds for Asynchronous Consensus
inferredcites →https://doi.org/10.1007/3-540-44743-1_4openalex-snapshot
Consensus in One Communication Step
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0028994openalex-snapshot
Time is not a healer
inferredcites →https://doi.org/10.1007/s00446-006-0005-xopenalex-snapshot
Fast Paxos
inferredcites →https://doi.org/10.1007/s004460050032openalex-snapshot
Early consensus in an asynchronous system with a weak failure detector
inferredcites →https://doi.org/10.1109/sfcs.1983.48openalex-snapshot
Randomized byzantine generals
inferredcites →https://doi.org/10.1137/s0097539796312915openalex-snapshot
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
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/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/637437.637447openalex-snapshot
Deconstructing paxos
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/98163.98167openalex-snapshot
Implementing fault-tolerant services using the state machine approach: a tutorial

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_23openalex-snapshot
On the Message Complexity of Indulgent Consensus
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/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-010-0117-1openalex-snapshot
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
inferred← citeshttps://doi.org/10.1007/s00446-010-0123-3openalex-snapshot
Verification of consensus algorithms using satisfiability solving
inferred← citeshttps://doi.org/10.1109/apsec.2009.23openalex-snapshot
Towards Automated Verification of Distributed Consensus Protocols
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/edcc.2010.23openalex-snapshot
HP: Hybrid Paxos for WANs
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566876openalex-snapshot
Fast Mencius: Mencius with low commit latency
inferred← citeshttps://doi.org/10.1109/ipdps.2011.301openalex-snapshot
Solving k-Set Agreement with Stable Skeleton Graphs
inferred← citeshttps://doi.org/10.1109/prdc63035.2024.00042openalex-snapshot
Sequential programming for distributed algorithm verification
inferred← citeshttps://doi.org/10.1109/saso.2010.42openalex-snapshot
Achieving Robust Self-Management for Large-Scale Distributed Applications
inferred← citeshttps://doi.org/10.1109/srds.2007.20openalex-snapshot
Model Checking of Consensus Algorit
inferred← citeshttps://doi.org/10.1109/srds.2011.38openalex-snapshot
Fast Genuine Generalized Consensus
inferred← citeshttps://doi.org/10.1109/tdsc.2011.48openalex-snapshot
Quantitative Analysis of Consensus Algorithms
inferred← citeshttps://doi.org/10.1109/waina.2012.178openalex-snapshot
Adaptive Strategies for Speeding Up Sequences of Consensus
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1145/1281100.1281136openalex-snapshot
Tolerating corrupted communication
inferred← citeshttps://doi.org/10.1186/s42400-025-00501-2openalex-snapshot
Survey of Consensus Protocol’s Formal Verification
inferred← citeshttps://doi.org/10.4018/ijdst.2015010102openalex-snapshot
Fast Paxos Made Easy
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4839openalex-snapshot
Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis
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.