Online tree node assignment with resource augmentation (Q652619): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9292-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3022305442 / 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: 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 18:35, 4 July 2024

scientific article
Language Label Description Also known as
English
Online tree node assignment with resource augmentation
scientific article

    Statements