Entry Kessler:1998:SED from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
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{Kessler:1998:SED,
author = "Christoph W. Kessler",
title = "Scheduling expression {DAGs} for minimal register
need",
journal = j-COMP-LANGS,
volume = "24",
number = "1",
pages = "33--53",
day = "1",
month = apr,
year = "1998",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Thu Oct 12 10:20:09 MDT 2000",
bibsource = "Compendex database;
http://www.elsevier.com/locate/complang;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/18/27/17/18/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/18/27/17/18/article.pdf",
acknowledgement = ack-nhfb,
affiliation = "Universitaet Trier",
affiliationaddress = "Trier, Ger",
classification = "721.1; 722.1; 723; 723.1; 921.5",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Algorithms; Code generation; Computational complexity;
Dynamic programming; Instruction scheduling; Program
compilers; Program optimization; Register allocation;
Storage allocation (computer)",
}
Related entries
- allocation,
6(1)47,
6(3)115,
12(3)145,
13(2)75,
15(2)83,
15(2)109,
16(2)179,
19(2)135,
21(2)101,
21(2)113,
22(2)51,
22(4)237,
35(4)406
- complexity,
3(3)163,
7(2)61,
7(3)103,
7(3)147,
9(3)133,
9(3)203,
10(3)211,
13(1)23,
13(3)109,
14(1)11,
14(2)125,
15(1)27,
15(2)83,
17(4)251,
17(4)269,
19(2)135,
19(3)169,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)177,
20(4)239,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(2)113
- computational,
1(1)17,
2(1)27,
7(3)147,
10(1)43,
10(3)211,
11(1)39,
13(1)13,
13(3)109,
14(1)11,
14(1)53,
14(2)125,
14(4)225,
15(1)1,
15(1)27,
15(2)83,
15(4)251,
16(2)113,
16(2)147,
17(4)251,
17(4)269,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(2)135,
19(3)157,
19(3)169,
20(1)1,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)151,
20(3)177,
20(4)213,
20(4)239,
20(4)253,
20(4)267,
21(1)17,
21(1)49,
21(2)67,
21(2)101,
21(2)113,
22(2)51,
22(2)115,
22(4)225,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- DAGs,
21(2)113
- dynamic,
4(3)187,
6(3)115,
9(3)149,
14(3)165,
15(1)1,
15(1)55,
16(1)39,
16(1)65,
18(2)105,
18(3)197,
20(1)43,
20(3)135,
20(4)253,
22(4)259,
25(4)211,
28(2)181,
28(3)237,
31(2)71,
35(1)21,
35(1)48,
35(1)63,
35(3)241,
35(3)252,
35(3)306,
36(2)158,
51(z)71,
51(z)90,
52(z)1,
53(z)73
- expression,
3(4)241,
4(3)131,
7(3)103,
8(1)1,
10(2)127,
12(2)123,
13(2)95,
14(3)153,
14(3)165,
15(3)127,
17(4)251,
18(4)241,
19(2)65,
20(4)267,
21(1)49,
21(2)113,
22(2)165,
37(2)63,
37(2)76,
46(z)167,
51(z)48
- generation,
3(4)241,
5(2)115,
6(3)115,
9(3)149,
9(3)193,
10(1)63,
10(2)127,
10(2)147,
12(1)47,
13(1)1,
13(3)125,
14(2)93,
14(3)193,
14(3)205,
15(1)27,
15(2)65,
15(3)127,
15(4)205,
16(1)39,
16(1)81,
17(1)1,
17(2)101,
17(4)251,
18(1)31,
18(2)137,
18(4)251,
19(3)169,
21(2)67,
21(2)101,
21(2)113,
34(4)184,
35(4)422,
36(2)203,
45(z)204,
49(z)152,
52(z)43,
53(z)121
- instruction,
9(3)149,
10(2)147,
11(1)1,
13(2)75,
15(2)83,
15(3)127,
19(3)169,
21(1)49,
21(2)101,
21(3)191
- Kessler, Christoph W.,
21(2)113
- minimal,
21(2)113,
22(4)225
- optimization,
1(2)161,
3(3)163,
5(1)29,
6(1)19,
8(2)69,
11(2)105,
14(2)63,
14(3)193,
15(1)27,
15(2)83,
16(1)81,
19(1)41,
19(2)91,
19(2)105,
19(3)205,
21(2)113,
22(2)115,
47(z)189,
54(z)119
- register,
6(1)47,
13(2)75,
15(1)27,
15(2)83,
19(2)135,
19(3)169,
21(1)49,
21(2)101,
21(2)113,
36(3)250
- scheduling,
6(3)131,
7(1)11,
15(3)153,
16(1)65,
21(1)49,
22(2)165,
36(2)158
- storage,
1(1)17,
8(1)15,
10(2)127,
12(3)145,
13(1)13,
13(2)75,
15(1)27,
15(2)83,
15(2)109,
16(2)129,
16(2)179,
19(2)135,
20(1)53,
20(3)135,
20(3)177,
20(4)253,
20(4)267,
21(2)101,
21(2)113,
22(2)115