Entry LeGoueslierdArgence:1998:ASB from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{LeGoueslierdArgence:1998:ASB,
author = "Patrick {Le Gou{\"e}slier d'Argence}",
title = "Affine scheduling on bounded convex polyhedric domains
is asymptotically optimal",
journal = j-THEOR-COMP-SCI,
volume = "196",
number = "1--2",
pages = "395--415",
day = "06",
month = apr,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=196&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/196/1-2/2745.pdf",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C4240P (Parallel
programming and algorithm theory)",
corpsource = "Paris VI Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "affine schedule; asymptotically optimal; automatic
parallelization; bounded convex polyhedric domains;
computational complexity; linear programming;
logarithmic function; longest path in a graph;
makespan; parallel programming; scheduling; scheduling
problem; uniform recurrence equations",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- affine,
138(1)201,
156(1)1
- asymptotically,
145(1)45,
185(2)347,
188(1)221
- automatic,
135(1)67,
162(1)133,
163(1)193,
167(1)193,
168(1)53,
169(1)39,
170(1)129,
172(1)67,
173(1)49,
183(1)143,
187(1)231,
188(1)161,
188(1)195
- bounded,
137(1)3,
139(1)131,
148(1)93,
151(1)163,
163(1)177,
164(1)59,
164(1)287,
166(1)203,
168(1)3,
168(1)21,
169(2)201,
172(1)135,
172(1)195,
173(1)183,
175(2)309,
176(1)89,
176(1)283,
178(1)103,
181(1)141,
181(2)267,
182(1)145,
191(1)61,
193(1)53,
193(1)75,
193(1)113,
194(1)137,
194(1)247-1,
204(1)11,
209(1)1
- convex,
138(1)3,
140(2)205,
141(1)337,
155(2)321,
157(2)185,
159(1)65,
174(1)193,
188(1)59,
193(1)1,
197(1)203,
218(2)273
- domain,
151(1)163,
151(1)195,
151(1)257,
151(1)z,
152(1)67,
155(1)221,
155(1)267,
159(2)319,
159(2)355,
160(1)1,
162(2)225,
165(1)57,
166(1)49,
166(1)203,
170(1)349,
171(1)247,
172(1)1,
172(1)43,
173(1)113,
173(1)209,
175(1)3,
176(1)89,
177(1)111,
177(1)155,
179(1)203,
179(1)217,
179(1)319,
179(1)421,
187(1)203,
189(1)179,
193(1)1,
193(1)53,
193(1)113,
193(1)181,
197(1)246-2,
216(1)159,
219(1)19,
219(1)169,
222(1)153
- equation,
138(1)67,
143(1)51,
144(1)59,
144(1)161,
145(1)71,
147(1)267,
151(1)257,
153(1)49,
154(1)3,
155(1)221,
155(1)267,
157(1)3,
157(1)79,
157(1)115,
157(1)z,
162(2)225,
168(1)105,
170(1)349,
173(1)183,
176(1)205,
176(1)347,
177(1)217,
177(2)407,
179(1)217,
180(1)287,
186(1)83,
187(1)3,
187(1)7,
187(1)27,
187(1)49,
187(1)81,
187(1)87,
187(1)179,
187(1)263,
187(1)z,
191(1)145,
192(1)3,
193(1)113,
197(1)247,
216(1)395,
224(1)215,
225(1)149
- logarithmic,
144(1)67,
159(1)43,
169(2)147,
207(1)217
- longest,
143(1)113,
143(2)353,
145(1)317,
147(1)31,
185(1)47
- makespan,
162(2)341
- optimal,
143(1)73,
143(1)123,
145(1)27,
147(1)1,
154(2)283,
154(2)367,
156(1)177,
157(2)161,
157(2)215,
159(2)191,
162(2)323,
163(1)239,
164(1)107,
164(1)299,
165(2)441,
166(1)221,
168(2)367,
172(1)265,
174(1)193,
178(1)225,
180(1)243,
180(1)309,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
197(1)189,
197(1)203,
197(1)242-2,
200(1)261,
203(2)205,
205(1)243,
210(2)341,
215(1)69,
220(2)363,
221(1)119,
222(1)113,
225(1)163,
227(1)79
- parallelization,
162(1)133,
180(1)169,
190(2)211,
196(1)71
- path,
139(1)355,
140(2)205,
140(2)231,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
142(2)179,
142(2)277,
143(1)175,
143(2)343,
145(1)27,
145(1)45,
145(1)111,
145(1)147,
145(1)329,
157(1)53,
157(1)101,
159(1)65,
160(1)87,
161(1)1,
166(1)49,
168(1)121,
175(1)127,
176(1)67,
183(1)21,
186(1)171,
188(1)1,
190(1)41,
203(1)143,
203(2)205,
208(1)33,
215(1)89,
225(1)163
- recurrence,
181(1)45,
187(1)203,
218(1)3
- schedule,
162(2)323,
190(2)363,
222(1)113
- scheduling,
144(1)277,
145(1)329,
147(1)1,
162(2)225,
162(2)323,
162(2)341,
164(1)73,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
181(2)357,
183(2)281,
191(1)205,
196(1)347,
215(1)137,
215(1)209,
220(1)157
- uniform,
142(2)257,
144(1)67,
144(1)161,
145(1)111,
145(1)381,
147(1)149,
151(1)277,
163(1)117,
180(1)17,
180(1)229,
183(2)187,
184(1)237,
188(1)231,
194(1)163,
196(1)259,
203(1)69,
206(1)219,
218(2)233,
219(1)301,
220(1)67,
221(1)457