Advice complexity of disjoint path allocation (Q2953693): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60692315, #quickstatements; #temporary_batch_1711094041063 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Online algorithms: a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Power of Advice and Randomization for the Disjoint Path Allocation Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Advice Complexity of Online Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online computation with advice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank |
Revision as of 05:58, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Advice complexity of disjoint path allocation |
scientific article |
Statements
Advice complexity of disjoint path allocation (English)
0 references
5 January 2017
0 references
advice complexity
0 references
online problems
0 references
disjoint path allocation
0 references