How to assign votes in a distributed system
Journal of the ACM (JACM)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Dualization of regular Boolean functions
Discrete Applied Mathematics
An O(mn) algorithm for regular set-covering problems
Theoretical Computer Science
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Enhancing concurrency and availability for database systems
Enhancing concurrency and availability for database systems
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Performance Characterization of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
Access Control and Signatures via Quorum Secret Sharing
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
Average probe complexity of non-dominated coteries (brief announcement)
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
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Message Complexity of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
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
Synchronous Byzantine quorum systems
Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Optimal coteries for rings and related networks
Distributed Computing
Distributed Computing
Average probe complexity in quorum systems
Journal of Computer and System Sciences
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
Counting and enumerating aggregate classifiers
Discrete Applied Mathematics
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Lattice-based computation of Boolean functions
Proceedings of the 47th Design Automation Conference
Dynamic grid quorum: a reconfigurable grid quorum and its power optimization algorithm
Service Oriented Computing and Applications
On the performance of distributed lock-based synchronization
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
On the performance of distributed lock-based synchronization?
ACM SIGOPS Operating Systems Review
Quorum based distributed conflict resolution algorithm for bounded capacity resources
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.01 |
A coterie under a ground set U consists of subsets (called quorums) of U such that anypair of quorums intersect with each other. Nondominated (ND) coteries are of particularinterest, since they are optimal in some sense. By assigning a Boolean variable to eachelement in U, a family of subsets of U is represented by a Boolean function of thesevariables. The authors characterize the ND coteries as exactly those families which canbe represented by positive, self-dual functions. In this Boolean framework, it is provedthat any function representing an ND coterie can be decomposed into copies of thethree-majority function, and this decomposition is representable as a binary tree. It isalso shown that the class of ND coteries proposed by D. Agrawal and A. El Abbadi (1989) is related to a special case of the above binary decomposition, and that the composition proposed by M.L. Neilsen and M. Mizuno (1992) is closely related to the classical Ashenhurst decomposition of Boolean functions. A number of other results are also obtained. The compactness of the proofs of most of these results indicates the suitability of Boolean algebra for the analysis of coteries.