Entry Franco:1989:CEP 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{Franco:1989:CEP,
author = "John Franco and Daniel P. Friedman",
title = "Creating efficient programs by exchanging data for
procedures",
journal = j-COMP-LANGS,
volume = "14",
number = "1",
pages = "11--23",
month = "????",
year = "1989",
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,
affiliationaddress = "Bloomington, IN, USA",
classcodes = "C6110 (Systems analysis and programming); C6140D (High
level languages)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "complexity; computational complexity; Computer
Operating Systems--Program Compilers; Computer
Programming; Computer Programming languages--lisp;
Computer Programs; Data Complication; data exchange;
LISP; low asymptotic; Macros; mutually recursive
procedures; Partition Problem; Program Asymptotic
Complexity; programming; programming style; Shortest
Path Problem; Topological Sort Problem",
treatment = "P Practical",
}
Related entries
- 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(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,
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)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,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- Creating,
34(2)109
- efficient,
10(3)211,
15(3)127,
16(1)81,
17(4)241,
19(1)41,
20(4)253,
22(4)225,
23(2)87,
34(4)170,
35(2)196,
35(3)217,
46(z)91,
46(z)167
- Franco, John,
15(1)55,
15(2)109
- Friedman, Daniel P.,
3(1)31,
3(4)241,
5(3)163,
11(1)29,
11(3)143,
12(2)109,
15(1)55,
15(2)109
- LISP,
3(4)241,
5(3)163,
7(2)61,
8(2)61,
17(4)251,
22(4)205,
22(4)215
- macro,
1(1)45,
3(2)95,
5(2)65,
6(3)139,
17(1)19
- mutually,
15(1)55
- operating,
2(4)117,
3(2)75,
3(3)163,
3(4)227,
3(4)241,
4(1)17,
4(2)71,
5(3)131,
5(3)141,
6(1)47,
6(3)139,
8(2)51,
8(2)61,
9(2)97,
9(3)149,
10(1)37,
10(2)127,
10(2)147,
10(3)165,
10(3)225,
11(2)85,
11(2)105,
12(1)9,
12(1)21,
12(1)47,
13(2)65,
13(2)75,
13(2)95,
14(1)1,
14(1)25,
14(3)193,
14(3)205,
15(1)27,
15(2)83,
15(3)127,
15(3)141,
15(3)163,
15(3)177,
15(4)193,
15(4)205,
16(1)81,
16(3)209,
17(4)213,
18(2)137,
20(2)69,
20(2)117,
21(1)17,
22(2)51
- partition,
22(1)39,
47(z)104
- path,
6(3)115,
15(2)65,
19(1)41,
19(2)119
- 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(3)137,
14(3)153,
14(4)255,
16(1)97,
16(3)235,
19(3)157,
19(3)169,
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
- procedure,
1(4)277,
1(4)303,
2(3)47,
2(4)117,
3(2)75,
3(3)181,
3(4)227,
4(2)71,
4(3)171,
5(2)65,
5(3)155,
6(3)115,
8(1)15,
10(1)63,
14(3)153,
14(4)225,
15(1)27,
15(2)95,
15(2)109,
16(1)5,
16(3)209,
17(1)67,
18(3)153,
19(2)105,
22(4)215
- Program, Systems-,
13(2)95,
14(3)193,
15(1)27,
15(3)127,
15(3)141,
16(1)81
- recursive,
3(1)31,
5(3)155,
6(3)115,
8(1)15,
11(2)55,
13(2)65,
14(2)93,
14(4)225,
15(1)55,
15(2)65,
15(4)193,
18(1)1,
19(1)19,
19(2)91,
24(1)1,
35(3)266,
53(z)143
- sort,
22(1)39
- style,
2(3)47,
3(1)1,
10(1)23,
12(1)1,
15(1)55,
15(3)127,
17(1)19,
19(3)185,
21(3)129,
38(1)61
- Systems--Program,
13(2)95,
14(3)193,
15(1)27,
15(3)127,
15(3)141,
16(1)81
- Topological,
14(2)125