How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems (Q4785693)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1848508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems |
scientific article; zbMATH DE number 1848508 |
Statements
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems (English)
0 references
5 January 2003
0 references
quorum systems
0 references
distributed computing
0 references
evasiveness
0 references
strong and simple games
0 references
0.8348717093467712
0 references
0.8345529437065125
0 references
0.8272214531898499
0 references
0.8255679607391357
0 references
0.8255676031112671
0 references
