How to assign votes in a distributed system
Journal of the ACM (JACM)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Dualization of regular Boolean functions
Discrete Applied Mathematics
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
The complexity of Boolean functions
The complexity of Boolean functions
On generating all maximal independent sets
Information Processing Letters
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Replicated data and partition failures
Distributed systems
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Decompositions of positive self-dual Boolean functions
Discrete Mathematics
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
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Maximum Latency and Identification of Positive Boolean Functions
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Identifying 2-Monotonic Positive Boolean Functions in Polynominal Time
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
The Availability of Quorum Systems
The Availability of Quorum Systems
Optimal coteries for rings and related networks
Distributed Computing
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Byzantine quorum systems with maximum availabililty
Information Processing Letters
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
IEEE Transactions on Parallel and Distributed Systems
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
Counting and enumerating aggregate classifiers
Discrete Applied Mathematics
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.01 |
A coterie, which is used to realize mutual exclusion in a distributed system, is a family C of incomparable subsets such that every pair of subsets in C has at least one element in common. Associate with a family of subsets C a positive (i.e., monotone) Boolean function fC such that fC(x) = 1 if the Boolean vector x is equal to or greater than the characteristic vector of some subset in C, and 0 otherwise. It is known that C is a coterie if and only if fC is dual-minor, and is a nondominated (ND) coterie if and only if fC is self-dual.In this paper, we introduce an operator 驴, which transforms a positive self-dual function into another positive self-dual function, and the concept of almost-self-duality, which is a close approximation to self-duality and can be checked in polynomial time (the complexity of checking positive self-duality is currently unknown). After proving several interesting properties of them, we propose a simple algorithm to check whether a given positive function is self-dual or not. Although this is not a polynomial algorithm, it is practically efficient in most cases. Finally, we present an incrementally polynomial algorithm that generates all positive self-dual functions (ND coteries) by repeatedly applying 驴 operations. Based on this algorithm, all ND coteries of up to seven variables are computed.