Entry Venugopal:1993:HCD 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{Venugopal:1993:HCD,
author = "R. Venugopal and Y. N. Srikant",
title = "Heuristic chaining in directed acyclic graphs",
journal = j-COMP-LANGS,
volume = "19",
number = "3",
pages = "169--184",
month = jul,
year = "1993",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Indian Inst of Science",
affiliationaddress = "Bangalore, India",
classcodes = "C4240 (Programming and algorithm theory); C1160
(Combinatorial mathematics)",
classification = "721.1; 722.1; 723.1",
corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of
Sci., Bangalore, India",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Algorithms; automatic programming; chaining; code
generation; Code generation; Codes (symbols);
computational complexity; Computational complexity;
directed; directed acyclic graphs; Directed acyclic
graphs; graphs; heuristic; heuristic chaining;
Heuristic chaining; Heuristic programming; instruction;
Instruction chaining; Microprocessor chips; NP-complete
problems; Optimal code generation; programming theory;
Reduced instruction set computing; registers; Shift
registers; simple; Vector processing; Vectors",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acyclic,
21(2)113
- automatic,
1(1)83,
1(2)161,
1(3)197,
1(4)321,
2(4)179,
3(3)163,
7(3)161,
11(3)173,
13(1)1,
14(2)93,
14(3)205,
15(3)127,
16(1)39,
16(2)129,
17(1)67,
18(4)251,
20(3)135,
20(4)239,
21(2)101,
21(2)113,
24(1)1,
27(1)115,
34(4)153,
36(2)203,
37(1)43,
43(z)96,
47(z)44,
53(z)59,
54(z)337,
54(z)512
- chaining,
35(1)31
- chips,
20(3)151
- complete, NP-,
10(3)211,
21(2)113
- 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,
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,
24(1)33
- 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,
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,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- computing,
2(3)93,
3(3)193,
10(3)179,
13(3)125,
14(1)1,
15(4)251,
16(3)197,
17(3)169,
18(3)153,
20(4)267,
21(1)49,
21(2)101,
21(3)147,
22(2)95,
22(4)215,
23(2)87,
33(1)33,
39(4)121,
40(1)1,
42(z)1,
45(z)163
- directed,
1(3)233,
3(2)115,
6(1)19,
7(2)69,
8(1)1,
14(3)205,
15(2)65,
19(4)213,
21(2)113,
23(2)161
- 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,
21(2)67,
21(2)101,
21(2)113,
24(1)33,
34(4)184,
35(4)422,
36(2)203,
45(z)204,
49(z)152,
52(z)43,
53(z)121
- graph,
1(3)255,
3(1)37,
3(2)65,
3(2)115,
3(3)163,
5(1)29,
5(2)115,
6(1)19,
6(1)47,
7(1)41,
7(3)147,
8(1)27,
8(2)69,
9(3)203,
10(1)43,
15(2)65,
19(2)91,
19(2)135,
19(3)205,
21(2)101,
21(2)113,
36(1)96,
39(1)25,
40(3)155
- heuristic,
4(2)99,
47(z)170
- instruction,
9(3)149,
10(2)147,
11(1)1,
13(2)75,
15(2)83,
15(3)127,
21(1)49,
21(2)101,
21(3)191,
24(1)33
- microprocessor,
9(1)39,
10(2)127,
10(3)179,
20(3)151
- NP-complete,
10(3)211,
21(2)113
- optimal,
7(1)41,
15(3)127,
20(1)43,
21(1)49,
21(2)113,
28(2)181,
35(4)406
- problem,
1(1)61,
1(1)83,
1(2)161,
1(3)197,
1(3)255,
1(4)321,
2(1)1,
2(3)75,
3(1)53,
3(3)145,
3(3)193,
4(1)17,
4(3)187,
5(3)155,
7(3)125,
8(2)69,
8(3)95,
11(3)161,
12(1)9,
14(1)11,
14(3)137,
14(3)153,
14(4)255,
16(1)97,
16(3)235,
19(3)157,
19(3)205,
20(3)177,
21(2)113,
22(1)27,
22(4)259,
23(1)25,
23(1)43,
23(2)61,
24(1)1,
26(2)165
- processing,
1(1)17,
1(1)73,
1(2)151,
3(1)37,
3(2)75,
3(2)127,
3(2)135,
3(3)181,
3(4)209,
4(2)93,
6(3)131,
6(3)155,
7(1)11,
7(1)25,
8(1)27,
8(2)51,
8(2)61,
8(3)113,
9(2)89,
9(2)97,
9(3)161,
9(3)193,
10(2)91,
11(1)39,
11(2)85,
12(1)39,
12(2)123,
13(1)23,
13(2)95,
13(3)149,
14(1)53,
14(4)239,
15(1)41,
15(2)95,
16(1)5,
16(1)39,
17(2)133,
17(4)213,
19(1)1,
19(1)51,
19(2)135,
19(3)185,
19(4)261,
20(1)25,
20(1)43,
20(3)135,
20(4)213,
21(2)81,
22(1)1,
22(2)165,
22(2)181,
22(4)205,
25(2)113,
32(1)2,
34(1)18,
54(z)406
- reduced,
21(1)49,
21(2)101
- register,
6(1)47,
13(2)75,
15(1)27,
15(2)83,
19(2)135,
21(1)49,
21(2)101,
21(2)113,
24(1)33,
36(3)250
- set,
1(2)161,
1(3)197,
6(3)155,
9(2)89,
9(3)149,
12(2)123,
13(3)143,
14(1)53,
15(2)65,
17(3)169,
20(1)1,
21(1)49,
21(2)101,
36(2)158,
47(z)19,
54(z)1
- Shift,
19(2)135
- simple,
1(4)287,
3(2)115,
5(2)103,
34(2)130,
38(2)181
- Srikant, Y. N.,
11(1)1,
13(1)1,
14(4)225,
15(4)193,
18(2)125,
20(3)135,
20(3)151,
21(1)49
- symbol,
1(2)105,
2(4)171,
10(2)127,
12(2)123,
16(2)167,
17(2)147,
17(3)169,
19(2)65,
19(2)79,
19(2)105,
20(2)69,
21(1)1,
21(1)17,
21(1)49,
21(2)101,
22(1)27,
22(1)39,
22(2)95,
23(1)1
- vector,
15(1)55,
32(1)2,
37(3)113
- Venugopal, R.,
21(1)49