Concurrent counting is harder than queuing (Q604464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Concurrent counting is harder than queuing |
scientific article; zbMATH DE number 5815224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concurrent counting is harder than queuing |
scientific article; zbMATH DE number 5815224 |
Statements
Concurrent counting is harder than queuing (English)
0 references
11 November 2010
0 references
distributed algorithms
0 references
distributed data structures
0 references
distributed counting
0 references
distributed queuing
0 references
0 references
0.8537479
0 references
0 references
0.81309557
0 references
0 references
0.81223094
0 references
0.8105626
0 references
0 references
