Advice complexity of disjoint path allocation (Q2953693): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60692315, #quickstatements; #temporary_batch_1711094041063
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1051/ita/2016020 / rank
Normal rank
 
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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ita/Kovacova16 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1051/ITA/2016020 / rank
 
Normal rank

Latest revision as of 06:06, 20 December 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
    0 references
    5 January 2017
    0 references
    advice complexity
    0 references
    online problems
    0 references
    disjoint path allocation
    0 references

    Identifiers