Journal of the ACM Bibliography

Selected papers that cite this one

• Divyakant Agrawal, Ömer E\u{g}ecio\u{g}lu, and Amr El Abbadi. Billard quorums on the grid. Information Processing Letters, 64(1):9-16, 14 October 1997.

• Yair Amir and Avishai Wool. Optimal availability quorum systems: Theory and practice. Information Processing Letters, 65(5):223-228, 13 March 1998.

• Jan C. Bioch and Toshihide Ibaraki. Complexity of identification and dualization of positive Boolean functions. Information and Computation, 123(1):50-63, 15 November 1995.

• Ye-In Chang. A simulation study on distributed mutual exclusion. Journal of Parallel and Distributed Computing, 33(2):107-121, 15 March 1996.

• Thomas Eiter and Georg Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, December 1995.

• Michael L. Fredman and Leonid Khachiyan. On the complexity of dualization of monotone disjunctive normal forms. Journal of Algorithms, 21(3):618-628, November 1996.

• Satoshi Fujita. A quorum based k-mutual exclusion by weighted k-quorum systems. Information Processing Letters, 67(4):191-197, 31 August 1998.

• Donald B. Johnson and Larry Raab. A tight upper bound on the benefits of replica control protocols. Journal of Computer and System Sciences, 51(2):168-176, October 1995.

• Yu-Chen Kuo and Shing-Tsaan Huang. A simple scheme to construct k-coteries with O(sqrt(N)) uniform quorum sizes. Information Processing Letters, 59(1):31-36, 8 July 1996.

• Xuemin Lin. A fully distributed quorum consensus method with high fault-tolerance and low communication overhead. Theoretical Computer Science, 185(2):259-275, 20 October 1997.

• Xuemin Lin and Maria E. Orlowska. An optimal voting scheme for minimizing the overall communication cost in replicated data management. Journal of Parallel and Distributed Computing, 35(1):97-103, 25 May 1996.

• Chor Ping Low. A fast search algorithm for the quorumcast routing problem. Information Processing Letters, 66(2):87-92, 29 April 1998.

• Kazuhisa Makino and Toshihide Ibaraki. The maximum latency and identification of positive Boolean functions. SIAM Journal on Computing, 26(5):1363-1383, October 1997.

• Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 569-578, El Paso, Texas, 4-6 May 1997.

• Yoshifumi Manabe, Roberto Baldoni, Michel Raynal, and Shigemi Aoyagi. k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion. Theoretical Computer Science, 193(1-2):97-112, 28 February 1998.

• Moni Naor and Avishai Wool. The load, capacity, and availability of quorum systems. SIAM Journal on Computing, 27(2):423-447, March 1998.

• David Peleg and Avishai Wool. The availability of quorum systems. Information and Computation, 123(2):210-223, December 1995.

• Roger Wattenhofer and Peter Widmayer. An inherent bottleneck in distributed counting. Journal of Parallel and Distributed Computing, 49(1):135-145, 25 February 1998.

Shortcuts: