A combined BIT and TIMESTAMP algorithm for the list update problem (Q672254): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4886073 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of randomization in on-line algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two results on the list update problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Randomized competitive algorithms for the list update problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for randomized list update algorithms / rank | |||
Normal rank | |||
Revision as of 10:16, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combined BIT and TIMESTAMP algorithm for the list update problem |
scientific article |
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
