Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501868
@@ Property / cites work: Q4501868 / rank @@
+Normal rank
@@ Property / cites work @@
+Some efficient solutions to the affine scheduling problem. I: One- dimensional time
+Normal rank
@@ Property / cites work @@
+Some efficient solutions to the affine scheduling problem. II: Multidimensional time
+Normal rank
@@ Property / cites work @@
+The Organization of Computations for Uniform Recurrence Equations
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(97)00209-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2088390443
@@ Property / OpenAlex ID: W2088390443 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1128739