On competitive on-line algorithms for the dynamic priority-ordering problem (Q1332747): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Thomas W. Reps / rank | |||
Property / author | |||
Property / author: Thomas W. Reps / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: VisiCalc / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00080-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1988846076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4003295 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2736362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the computational complexity of dynamic graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded incremental computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3741011 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4041055 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On incremental evaluation of ordered attributed grammars / rank | |||
Normal rank |
Latest revision as of 17:37, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On competitive on-line algorithms for the dynamic priority-ordering problem |
scientific article |
Statements
On competitive on-line algorithms for the dynamic priority-ordering problem (English)
0 references
14 August 2000
0 references