How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
Replicated data and partition failures
Distributed systems
Optimal coteries and voting schemes
Information Processing Letters
The availability of quorum systems
Information and Computation
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Optimal availability quorum systems: theory and practice
Information Processing Letters
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Transformation of Regular Non-Dominated Coteries
Transformation of Regular Non-Dominated Coteries
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
A coterie is a family of subsets such that every pair of subsets in it has at least one element in common but neither is a subset of the other. We introduce an operator &sgr;, which transforms a ND (non-dominated; see the Introduction for definition) coterie to another ND coterie. A “regular” coterie is a natural generalization of a “vote-assignable” coterie, which is used in some practical applications. We show that any regular ND coterie C can be transformed to any other regular ND coterie D by judiciously applying &sgr; operations to C at most |C| + |D| - 2 times.As another application of the &sgr; operation, we present an incrementally-polynomial-time algorithm for generating all regular ND coteries. We then introduce the concept of a “g-regular” function, as a generalization of availability. We show how to construct an optimum coterie C with respect to a g-regular function in O(n3|C|) time.