A theory of coteries: mutual exclusion in distributed systems

zuev, 1989, Asymptotics of the logarithm of the number of threshold functions of the algebra of logic, Soviet Math Dokl, 39, 512

10.1109/PGEC.1965.264090

10.1109/T-C.1970.222921

10.1145/320071.320076

eiter, 1991, Identifying the minimal transversals of a hypergraph and related problems

fu, 1990, Enhancing Concurrency and Availability for Database Systems

10.1145/4221.4223

clifford, 1979, Weighted voting for replicated data, Proc 7th ACM Symp Operat Syst, 150

harrison, 1965, Introduction to Switching and Automata Theory

10.1145/22952.22953

ibaraki, 1990, A theory of coteries

10.1109/SPDP.1991.218285

10.2307/1998052

knuth, 1973, The Art of Computer Programming Vol 1 Fundamental Algorithms

shapley, 1967, New Methods of Thought and Procedures

10.1016/0304-3975(87)90131-9

ramamurthy, 1988, A new algorithm to find the smallest committee containing a given set of players, Opsearch, 25, 49

10.1007/BF01786230

10.1137/0113027

skeen, 1982, A quorum-based commit protocol, Proc 6th Berkeley Workshop Distributed Data Management and Computer Networks, 69

10.1016/0095-8956(71)90033-5

cheung, 1989, Multi-dimensional voting A general method for implementing synchronization in distributed systems

10.1109/69.87983

ashenhurst, 1957, The decomposition of switching functions, Proc Int Symp Theory of Switching, 74

10.1016/0166-218X(87)90056-4

10.1145/72981.72994

kor?unov, 1977, Solution of Dedekind's problem on the number of monotone Boolean functions, Soviet Math Dokl, 18, 442

m�hring, 1985, Algorithms and Software for Optimization, 4, 195

10.1145/214438.214445

10.1109/71.159041

muroga, 1971, Threshold Logic and Its Applications

10.1016/0166-218X(85)90040-X

10.1109/RELDIS.1990.93958