Weighted online problems with advice (Q726104): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1566381
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-017-9806-5 / rank
Normal rank
 
Property / author
 
Property / author: Lene Monrad Favrholdt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754371449 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.05210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online makespan minimization with parallel schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The string guessing problem as a method to prove lower bounds on the advice complexity / 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: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bounded Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The advice complexity of a class of hard online problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LRU is better than FIFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the problem-relevant information in input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity of the Online Induced Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms with advice for bin packing and scheduling problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-017-9806-5 / rank
 
Normal rank

Latest revision as of 02:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Weighted online problems with advice
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references