Weighted Online Problems with Advice (Q2819501): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Online Bounded Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954988 / 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: Q4606307 / 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 Search 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

Latest revision as of 14:52, 12 July 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