Optimal-time adaptive strong renaming, with applications to counting (Q2943401)
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: Optimal-time adaptive strong renaming, with applications to counting |
scientific article; zbMATH DE number 6481666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal-time adaptive strong renaming, with applications to counting |
scientific article; zbMATH DE number 6481666 |
Statements
Optimal-time adaptive strong renaming, with applications to counting (English)
0 references
11 September 2015
0 references
adaptive algorithms
0 references
distributed computing
0 references
lower bounds
0 references
renaming
0 references
shared memory
0 references
sorting networks
0 references
0 references
0 references
0.8867459893226624
0 references
0.8355993032455444
0 references
0.8323572874069214
0 references
0.827553927898407
0 references
