Constant-competitive tree node assignment (Q391778): Difference between revisions

@@ Property / author @@
-Yong Zhang
@@ Property / author: Yong Zhang / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.05.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2156051565
@@ Property / OpenAlex ID: W2156051565 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast allocation and deallocation with an improved buddy system
+Normal rank
@@ Property / cites work @@
+Greedy online frequency allocation in cellular networks
+Normal rank
@@ Property / cites work @@
+Online tree node assignment with resource augmentation
+Normal rank
@@ Property / cites work @@
+A constant-competitive algorithm for online OVSF code assignment
+Normal rank
@@ Property / cites work @@
+Online OVSF Code Assignment with Resource Augmentation
+Normal rank
@@ Property / cites work @@
+Subcube allocation in hypercube computers
@@ Property / cites work: Subcube allocation in hypercube computers / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic view on OVSF code assignment
@@ Property / cites work: An algorithmic view on OVSF code assignment / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+A fast storage allocator
@@ Property / cites work: A fast storage allocator / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398780
@@ Property / cites work: Q4398780 / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
+Normal rank