Average probe complexity in quorum systems

Yehuda Hassin; David Peleg

doi:10.1016/j.jcss.2005.10.003

Average probe complexity in quorum systems

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2005.10.003 ◽

2006 ◽

Vol 72 (4) ◽

pp. 592-616 ◽

Cited By ~ 1

Author(s):

Yehuda Hassin ◽

David Peleg

Keyword(s):

Quorum Systems ◽

Probe Complexity

Download Full-text

Average probe complexity in quorum systems

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01 ◽

10.1145/383962.384014 ◽

2001 ◽

Cited By ~ 4

Author(s):

Yehuda Hassin ◽

David Peleg

Keyword(s):

Quorum Systems ◽

Probe Complexity

Download Full-text

How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

SIAM Journal on Discrete Mathematics ◽

10.1137/s0895480198343819 ◽

2002 ◽

Vol 15 (3) ◽

pp. 416-433 ◽

Cited By ~ 13

Author(s):

David Peleg ◽

Avishai Wool

Keyword(s):

Quorum Systems ◽

Probe Complexity

Download Full-text

How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)

Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 ◽

10.1145/248052.248112 ◽

1996 ◽

Cited By ~ 7

Author(s):

David Peleg ◽

Avishai Wool

Keyword(s):

Quorum Systems ◽

Probe Complexity

Download Full-text

The load and availability of Byzantine quorum systems

Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 ◽

10.1145/259380.259450 ◽

1997 ◽

Cited By ~ 9

Author(s):

Dahlia Malkhi ◽

Michael Reiter ◽

Avishai Wool

Keyword(s):

Quorum Systems

Download Full-text

Constructing Byzantine Quorum systems from combinatorial designs

Information Processing Letters ◽

10.1016/s0020-0190(99)00075-7 ◽

1999 ◽

Vol 71 (1) ◽

pp. 35-42 ◽

Cited By ~ 1

Author(s):

Tatsuhiro Tsuchiya ◽

Nobuhiko Ido ◽

Tohru Kikuno

Keyword(s):

Combinatorial Designs ◽

Quorum Systems

Download Full-text

The Cell Probe Complexity of Succinct Data Structures

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-45061-0_28 ◽

2003 ◽

pp. 332-344 ◽

Cited By ~ 5

Author(s):

Anna Gál ◽

Peter Bro Miltersen

Keyword(s):

Data Structures ◽

Succinct Data Structures ◽

Probe Complexity

Download Full-text

The bit probe complexity measure revisited

Lecture Notes in Computer Science - STACS 93 ◽

10.1007/3-540-56503-5_65 ◽

1993 ◽

pp. 662-671 ◽

Cited By ~ 15

Author(s):

Peter Bro Miltersen

Keyword(s):

Complexity Measure ◽

Probe Complexity

Download Full-text

On quorum systems for group resources allocation

Distributed Computing ◽

10.1007/s00446-010-0094-4 ◽

2010 ◽

Vol 22 (3) ◽

pp. 197-214 ◽

Cited By ~ 3

Author(s):

Yuh-Jzer Joung

Keyword(s):

Resources Allocation ◽

Quorum Systems

Download Full-text

Probabilistic Quorum Systems

Information and Computation ◽

10.1006/inco.2001.3054 ◽

2001 ◽

Vol 170 (2) ◽

pp. 184-206 ◽

Cited By ~ 73

Author(s):

Dahlia Malkhi ◽

Michael K Reiter ◽

Avishai Wool ◽

Rebecca N Wright

Keyword(s):

Quorum Systems

Download Full-text

Probabilistic Opaque Quorum Systems

Lecture Notes in Computer Science - Distributed Computing ◽

10.1007/978-3-540-75142-7_31 ◽

2007 ◽

pp. 403-419 ◽

Cited By ~ 7

Author(s):

Michael G. Merideth ◽

Michael K. Reiter

Keyword(s):

Quorum Systems

Download Full-text