On the public citation graph
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
0 signed · 33 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/bf02242737openalex-snapshot
Optimal coteries for rings and related networks
inferredcites →https://doi.org/10.1109/24.536994openalex-snapshot
A cut-based method for terminal-pair reliability
inferredcites →https://doi.org/10.1109/69.219738openalex-snapshot
Obtaining coteries that optimize the availability of replicated databases
inferredcites →https://doi.org/10.1109/71.262589openalex-snapshot
Voting as the optimal static pessimistic scheme for managing replicated data
inferredcites →https://doi.org/10.1109/71.466629openalex-snapshot
Generating and approximating nondominated coteries
inferredcites →https://doi.org/10.1109/71.539734openalex-snapshot
An analysis of the average message overhead in replica control protocols
inferredcites →https://doi.org/10.1109/71.569655openalex-snapshot
Delay-optimal quorum consensus for distributed systems
inferredcites →https://doi.org/10.1109/icdcs.1998.679773openalex-snapshot
A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability
inferredcites →https://doi.org/10.1137/0216065openalex-snapshot
An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
inferredcites →https://doi.org/10.1137/s0097539795281232openalex-snapshot
The Load, Capacity, and Availability of Quorum Systems
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/24068.28052openalex-snapshot
The information structure of distributed mutual exclusion algorithms
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
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-642-11294-2_10openalex-snapshot
Selected Results from the Latest Decade of Quorum Systems Research
inferred← citeshttps://doi.org/10.1007/s00453-003-1066-xopenalex-snapshot
Delay Optimization in Quorum Consensus
inferred← citeshttps://doi.org/10.1007/s11761-010-0069-0openalex-snapshot
Dynamic grid quorum: a reconfigurable grid quorum and its power optimization algorithm
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00023-1openalex-snapshot
Minimizing the mean delay of quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1016/s0920-5489(02)00105-8openalex-snapshot
A survey of permission-based distributed mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1023/a:1011494323443openalex-snapshot
Gossip-Style Failure Detection and Distributed Consensus for Scalable Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1109/71.970560openalex-snapshot
A delay-optimal quorum-based mutual exclusion algorithm for distributed systems
inferred← citeshttps://doi.org/10.1109/compsym.2010.5685380openalex-snapshot
Use of shrinking quorums to improve efficiency of replication protocols
inferred← citeshttps://doi.org/10.1109/dsn.2007.66openalex-snapshot
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
inferred← citeshttps://doi.org/10.1109/dsn.2014.34openalex-snapshot
Performance Sensitive Replication in Geo-distributed Cloud Datastores
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302972openalex-snapshot
An efficient distributed mutual exclusion algorithm based on relative consensus voting
inferred← citeshttps://doi.org/10.1109/ispdc.2006.29openalex-snapshot
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
inferred← citeshttps://doi.org/10.1109/sbac-pad.2004.4openalex-snapshot
A Performance Evaluation of a Quorum-Based State-Machine Replication Algorithm For Computing Grids
inferred← citeshttps://doi.org/10.1109/soca.2009.5410451openalex-snapshot
Dynamic grid quorum: A novel approach for minimizing power consumption without data migration in grid quorums
inferred← citeshttps://doi.org/10.1109/srds.2009.35openalex-snapshot
When and How to Change Quorums on Wide Area Networks
inferred← citeshttps://doi.org/10.1145/1073814.1073829openalex-snapshot
Quorum placement in networks to minimize access delays
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.