On the public citation graph
Voting as the optimal static pessimistic scheme for managing replicated data
0 signed · 66 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-54099-7_18openalex-snapshot
Weighted voting for operation dependent management of replicated data
inferredcites →https://doi.org/10.1109/32.16608openalex-snapshot
Performance characterization of quorum-consensus algorithms for replicated data
inferredcites →https://doi.org/10.1109/icdcs.1990.89304openalex-snapshot
Multidimensional voting: a general method for implementing synchronization in distributed systems
inferredcites →https://doi.org/10.1109/icde.1988.105456openalex-snapshot
Integrating static and dynamic voting protocols to enhance file availability
inferredcites →https://doi.org/10.1109/icde.1988.105469openalex-snapshot
Efficient dynamic voting algorithms
inferredcites →https://doi.org/10.1109/icde.1989.47226openalex-snapshot
Optimizing vote and quorum assignments for reading and writing replicated data
inferredcites →https://doi.org/10.1109/icde.1989.47259openalex-snapshot
A scheme for maintaining consistency and availability of replicated files in a partitioned distributed system
inferredcites →https://doi.org/10.1109/reldis.1988.25789openalex-snapshot
Vote assignments in weighted voting mechanisms
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.1137/0132031openalex-snapshot
Computing the Reliability of Complex Networks
inferredcites →https://doi.org/10.1145/10590.10607openalex-snapshot
Protocols for dynamic vote reassignment
inferredcites →https://doi.org/10.1145/1994.2207openalex-snapshot
An algorithm for concurrency control and recovery in replicated distributed databases
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/5505.5508openalex-snapshot
Consistency in a partitioned network: a survey
inferredcites →https://doi.org/10.1145/6306.6308openalex-snapshot
A quorum-consensus replication method for abstract data types
inferredcites →https://doi.org/10.1145/66926.67809openalex-snapshot
A static pessimistic scheme for handling replicated databases
inferredcites →https://doi.org/10.1145/67544.67809openalex-snapshot
A static pessimistic scheme for handling replicated databases
inferredcites →https://doi.org/10.1145/78922.78926openalex-snapshot
Dynamic voting algorithms for maintaining the consistency of a replicated database
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1059openalex-snapshot
A Tight Upper Bound on the Benefits of Replica Control Protocols
inferred← citeshttps://doi.org/10.1006/jctb.2001.2045openalex-snapshot
Dynamic Monopolies of Constant Size
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0072openalex-snapshot
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management
inferred← citeshttps://doi.org/10.1007/978-0-585-27316-7_6openalex-snapshot
Use of Imprecise Computation to Enhance Dependability of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_22openalex-snapshot
Optimal Decision Strategies in Byzantine Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_8openalex-snapshot
Immunity against Local Influence
inferred← citeshttps://doi.org/10.1007/s004460050027openalex-snapshot
Crumbling walls: a class of practical and efficient quorum systems
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00064-6openalex-snapshot
Optimal coteries and voting schemes
inferred← citeshttps://doi.org/10.1016/0951-8320(96)00012-9openalex-snapshot
A taxonomy of voting schemes for data fusion and dependable computation
inferred← citeshttps://doi.org/10.1016/j.ins.2004.09.005openalex-snapshot
Proxy agent based replication control model for wireless internet
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.10.011openalex-snapshot
Optimal decision strategies in Byzantine environments
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00017-9openalex-snapshot
Optimal availability quorum systems: Theory and practice
inferred← citeshttps://doi.org/10.1016/s0164-1212(00)00056-xopenalex-snapshot
Optimal binary vote assignment for replicated data
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(96)00016-9openalex-snapshot
The availability of crumbling wall quorum systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00055-xopenalex-snapshot
Local majorities, coalitions and monopolies in graphs: a review
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.1080/00207729808929572openalex-snapshot
Optimal cost design of replicated data in distributed database systems
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.762814openalex-snapshot
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1109/ecice47484.2019.8942731openalex-snapshot
Reliable Resource Management for IoT based Logistic Services
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534591openalex-snapshot
Evaluating quorum systems over the Internet
inferred← citeshttps://doi.org/10.1109/ftcs.1998.689476openalex-snapshot
Optimal replica control protocols exhibit symmetric operation availabilities
inferred← citeshttps://doi.org/10.1109/icpads.2012.26openalex-snapshot
Maximizing Availability of Consistent Data in Unreliable Networks
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370343openalex-snapshot
Expected Time for Obtaining Dependable Data in Real-Time Environment
inferred← citeshttps://doi.org/10.1109/iscc-c.2013.95openalex-snapshot
On the Availability of Replicated Data Managed by Hierarchical Voting
inferred← citeshttps://doi.org/10.1109/rtas.2007.37openalex-snapshot
Take Intelligent Risk and Optimize Decision Based on Time, Available Resources and Risk Tolerance Limits
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365692openalex-snapshot
The load, capacity and availability of quorum systems
inferred← citeshttps://doi.org/10.1109/waina.2008.262openalex-snapshot
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
inferred← citeshttps://doi.org/10.1137/s0097539795281232openalex-snapshot
The Load, Capacity, and Availability of Quorum Systems
inferred← citeshttps://doi.org/10.1137/s0895480100371110openalex-snapshot
Transformations on Regular Nondominated Coteries and Their Applications
inferred← citeshttps://doi.org/10.1137/s0895480102408213openalex-snapshot
Listen to Your Neighbors: How (Not) to Reach a Consensus
inferred← citeshttps://doi.org/10.1142/s0129626406002496openalex-snapshot
VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS
inferred← citeshttps://doi.org/10.1145/1124153.1124156openalex-snapshot
The costs and limits of availability for replicated services
inferred← citeshttps://doi.org/10.1145/249978.249982openalex-snapshot
An adaptive data replication algorithm
inferred← citeshttps://doi.org/10.1145/2749246.2749259openalex-snapshot
Bidding for Highly Available Services with Low Price in Spot Instance Market
inferred← citeshttps://doi.org/10.1145/343477.343629openalex-snapshot
Efficient generation of all regular non-dominated coteries
inferred← citeshttps://doi.org/10.1145/502034.502038openalex-snapshot
The costs and limits of availability for replicated services
inferred← citeshttps://doi.org/10.1145/937598.937601openalex-snapshot
Are quorums an alternative for data replication?
inferred← citeshttps://doi.org/10.33168/jsms.2022.0113openalex-snapshot
Replicated Data Management using Scaled Segment Chain in Unstable IoT Environments
inferred← citeshttps://doi.org/10.33832/ijast.2019.124.08openalex-snapshot
Viability-Based Replication Management Scheme for Reliable IoT Data Services
inferred← citeshttps://doi.org/10.7146/brics.v7i8.20135openalex-snapshot
Democratic Consensus and the Local Majority Rule
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.