Advice Complexity of the Online Search Problem (Q2819505): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: 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 the k-Server 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: The online knapsack problem: advice and randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Performance Measures via Online Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Much Information about the Future Is Needed? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search and one-way trading online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Advice Complexity of the k-server Problem under Sparse Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for \(k\)-search with application in option pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Online Algorithms with Advice for the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for the online time series search problem / rank
 
Normal rank

Latest revision as of 14:52, 12 July 2024

scientific article
Language Label Description Also known as
English
Advice Complexity of the Online Search Problem
scientific article

    Statements

    Advice Complexity of the Online Search Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2016
    0 references

    Identifiers