A lower bound for randomized on-line multiprocessor scheduling (Q287130): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W20
@@ Property / Mathematics Subject Classification ID: 68W20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W27
@@ Property / Mathematics Subject Classification ID: 68W27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6585441
@@ Property / zbMATH DE Number: 6585441 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial problems
@@ Property / zbMATH Keywords: combinatorial problems / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+online algorithms
@@ Property / zbMATH Keywords: online algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+randomization
@@ Property / zbMATH Keywords: randomization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+worst-case bounds
@@ Property / zbMATH Keywords: worst-case bounds / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:287130