A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254)
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: A combined BIT and TIMESTAMP algorithm for the list update problem |
scientific article; zbMATH DE number 984889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combined BIT and TIMESTAMP algorithm for the list update problem |
scientific article; zbMATH DE number 984889 |
Statements
A combined BIT and TIMESTAMP algorithm for the list update problem (English)
0 references
28 February 1997
0 references
On-line algorithms
0 references
Analysis of algorithms
0 references
Competitive analysis
0 references
List-update
0 references
0.8702853
0 references
0.86882484
0 references
0.86120534
0 references
0.85785407
0 references
0.8575499
0 references
0.85747755
0 references
0.85681856
0 references
0.8447101
0 references
