Advice Complexity and Barely Random Algorithms (Q5198936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013227361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / 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 algorithms with advice: the tape model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / 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: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5755525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice Complexity and Barely Random Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization for job shop scheduling with<i>k</i>-units length tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized competitive algorithms for the list update problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:50, 4 July 2024

scientific article; zbMATH DE number 5937671
Language Label Description Also known as
English
Advice Complexity and Barely Random Algorithms
scientific article; zbMATH DE number 5937671

    Statements

    Identifiers

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