On the public citation graph

A fault-tolerant algorithm for replicated data management

0 signed · 58 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/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0020-0190(90)90194-3openalex-snapshot
Exploiting logical structures in replicated databases
inferredcites →https://doi.org/10.1109/12.83661openalex-snapshot
Hierarchical quorum consensus: a new algorithm for managing 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.89306openalex-snapshot
Performance analysis of a hierarchical quorum consensus algorithm for replicated objects
inferredcites →https://doi.org/10.1109/icde.1988.105469openalex-snapshot
Efficient dynamic voting algorithms
inferredcites →https://doi.org/10.1109/icde.1990.113497openalex-snapshot
The grid protocol: a high performance scheme for maintaining replicated data
inferredcites →https://doi.org/10.1145/118544.118552openalex-snapshot
Multidimensional voting
inferredcites →https://doi.org/10.1145/1270.1499openalex-snapshot
Optimism and consistency in partitioned distributed database 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/319989.319992openalex-snapshot
Achieving robustness in distributed database systems
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/323627.323637openalex-snapshot
Consistency and recovery control for replicated files
inferredcites →https://doi.org/10.1145/323647.323637openalex-snapshot
Consistency and recovery control for replicated files
inferredcites →https://doi.org/10.1145/325405.325443openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1145/357369.357371openalex-snapshot
Fail-stop processors
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
inferredcites →https://doi.org/10.1145/38713.38740openalex-snapshot
Dynamic voting
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/72981.72994openalex-snapshot
Efficient solution to the distributed mutual exclusion problem
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.2307/2288237openalex-snapshot
Probability and Statistics With Reliability, Queuing, and Computer Science Applications.
inferredcites →https://doi.org/10.5555/800253.807732openalex-snapshot
A principle for resilient sharing of distributed resources

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1025openalex-snapshot
Efficient and Robust Sharing of Memory in Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/s002360050096openalex-snapshot
On the scalability and mean-time to failure of $k$ resilient protocols
inferred← citeshttps://doi.org/10.1007/s40009-018-0615-4openalex-snapshot
A Modified Method for Generation of Communication Sets
inferred← citeshttps://doi.org/10.1016/b978-0-12-818105-8.00013-9openalex-snapshot
Information Redundancy
inferred← citeshttps://doi.org/10.1016/b978-012088525-1/50006-7openalex-snapshot
Information Redundancy
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.09.001openalex-snapshot
Making data-centric storage adaptive and cost-optimal
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.2012.01.005openalex-snapshot
Info-based approach in distributed mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1016/j.sysarc.2003.12.003openalex-snapshot
Replication algorithms for the World-Wide Web
inferred← citeshttps://doi.org/10.1016/s0141-9331(02)00037-6openalex-snapshot
On fault-tolerant data replication in distributed systems
inferred← citeshttps://doi.org/10.1016/s0164-1212(03)00097-9openalex-snapshot
Analyzing reconfigurable algorithms for managing replicated data
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00116-3openalex-snapshot
A delay optimal coterie on the k-dimensional folded Petersen graph
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:1008785706349openalex-snapshot
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
inferred← citeshttps://doi.org/10.1093/comjnl/39.9.767openalex-snapshot
Analysis of Replicated Data with Repair Dependency
inferred← citeshttps://doi.org/10.1109/71.539734openalex-snapshot
An analysis of the average message overhead in replica control protocols
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/anziis.1996.573918openalex-snapshot
An indicator of robustness for distributed databases
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363945openalex-snapshot
Comparison of eager and quorum-based replication in a cloud environment
inferred← citeshttps://doi.org/10.1109/ftcs.1998.689476openalex-snapshot
Optimal replica control protocols exhibit symmetric operation availabilities
inferred← citeshttps://doi.org/10.1109/hpcsa.2002.1019138openalex-snapshot
Replication algorithms for the World-Wide Web
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679773openalex-snapshot
A delay-optimal quorum-based mutual exclusion scheme with fault-tolerance capability
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/pdis.1996.568679openalex-snapshot
Repairman models for replicated data management: a case study
inferred← citeshttps://doi.org/10.1109/reldi.2000.885408openalex-snapshot
Database replication techniques: a three parameter classification
inferred← citeshttps://doi.org/10.1109/reldis.1996.559695openalex-snapshot
Analyzing dynamic voting using Petri nets
inferred← citeshttps://doi.org/10.1145/937598.937601openalex-snapshot
Are quorums an alternative for data replication?
inferred← citeshttps://doi.org/10.23860/thesis-alsop-frank-1994openalex-snapshot
An Evaluation of the Open Object-Oriented Database
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.171-172.675openalex-snapshot
The Average Message Complexity Analysis for Different Distributed Mutual Exclusion Site-Tolerant Ways
inferred← citeshttps://doi.org/10.5075/epfl-thesis-2577openalex-snapshot
Group communications and database replication : techniques, issues and performance
inferred← citeshttps://doi.org/10.51406/jnset.v14i1.1487openalex-snapshot
REPLICATION-BASED COST SCHEDULING STRATEGY FOR FAULT TOLERANCE IN DISTRIBUTED KNOWLEDGE MANAGEMENT SYSTEMS
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.