Online Tree Node Assignment with Resource Augmentation (Q5323084): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_36 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980218473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast allocation and deallocation with an improved buddy system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-Competitive Algorithm for Online OVSF Code Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-competitive tree node assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online OVSF Code Assignment with Resource Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic view on OVSF code assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bandwidth Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast storage allocator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Competitive Ratio of the Online OVSF Code Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: OVSF-CDMA code assignment in wireless ad hoc networks / rank
 
Normal rank

Latest revision as of 20:22, 1 July 2024

scientific article; zbMATH DE number 5585636
Language Label Description Also known as
English
Online Tree Node Assignment with Resource Augmentation
scientific article; zbMATH DE number 5585636

    Statements