On the public citation graph

Optimal coteries for rings and related networks

0 signed · 34 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.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1109/71.238300openalex-snapshot
A theory of coteries: mutual exclusion in distributed systems
inferredcites →https://doi.org/10.1109/icdcs.1992.235109openalex-snapshot
Optimal coteries for rings and related networks
inferredcites →https://doi.org/10.1109/reldis.1990.93958openalex-snapshot
Voting as the optimal static pessimistic scheme for managing replicated data
inferredcites →https://doi.org/10.1109/reldis.1992.235142openalex-snapshot
Optimal replica control protocols for ring networks
inferredcites →https://doi.org/10.1109/spdp.1991.218285openalex-snapshot
Boolean theory of coteries
inferredcites →https://doi.org/10.1109/tc.1987.1676860openalex-snapshot
The Reliability of Voting Mechanisms
inferredcites →https://doi.org/10.1109/tr.1986.4335422openalex-snapshot
Computational Complexity of Network Reliability Analysis: An Overview
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1145/112600.112608openalex-snapshot
Optimal coteries
inferredcites →https://doi.org/10.1145/214438.214445openalex-snapshot
A √N algorithm for mutual exclusion in decentralized systems
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/6420.6421openalex-snapshot
The vulnerability of vote assignments
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45678-3_49openalex-snapshot
Delay Optimizations in Quorum Consensus
inferred← citeshttps://doi.org/10.1007/s00453-003-1066-xopenalex-snapshot
Delay Optimization in Quorum Consensus
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.11.006openalex-snapshot
On the tradeoff of availability and consistency for quorum systems in data center networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00311-8openalex-snapshot
Byzantine quorum systems with maximum availability
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/s0166-218x(99)00096-7openalex-snapshot
Minimum self-dual decompositions of positive dual-minor Boolean functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00208-4openalex-snapshot
Planar quorums
inferred← citeshttps://doi.org/10.1016/s0920-5489(01)00080-0openalex-snapshot
Delay optimal coteries on regular symmetric networks
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.1093/comjnl/42.7.613openalex-snapshot
Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks
inferred← citeshttps://doi.org/10.1109/12.780882openalex-snapshot
Improving the availability of mutual exclusion systems on incomplete networks
inferred← citeshttps://doi.org/10.1109/71.466629openalex-snapshot
Generating and approximating nondominated coteries
inferred← citeshttps://doi.org/10.1109/71.569655openalex-snapshot
Delay-optimal quorum consensus for distributed systems
inferred← citeshttps://doi.org/10.1109/71.595585openalex-snapshot
Nondominated coteries on graphs
inferred← citeshttps://doi.org/10.1109/71.762814openalex-snapshot
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534591openalex-snapshot
Evaluating quorum systems over the Internet
inferred← citeshttps://doi.org/10.1109/icdcs.2007.96openalex-snapshot
D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution
inferred← citeshttps://doi.org/10.1109/icpads.2012.26openalex-snapshot
Maximizing Availability of Consistent Data in Unreliable Networks
inferred← citeshttps://doi.org/10.1109/iwqos.2014.6914306openalex-snapshot
A quantitative analysis of quorum system availability in data centers
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.