Entry Ramanan:1992:TOA from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Ramanan:1992:TOA,
author = "P. Ramanan",
title = "Testing the optimality of alphabetic trees",
journal = j-THEOR-COMP-SCI,
volume = "93",
number = "2",
pages = "279--301",
day = "17",
month = feb,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Wichita State Univ., KS, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabetic trees; computational complexity;
correctness; Hu-Tucker algorithm; linear decision tree;
lower bound; necessary and sufficient conditions;
optimality testing; skewed trees; tree shape; trees
(mathematics); weight sequence; well-balanced trees;
worst-case time complexity",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabetic,
99(2)177,
113(1)35,
134(2)403
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
83(2)169,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- case, worst-,
74(3)273,
84(1)127,
100(1)185,
103(2)283,
117(1)187,
120(2)197,
128(1)75,
129(2)397,
132(1)1
- condition,
70(1)35,
70(1)151,
70(2)179,
72(1)27,
74(1)3,
75(1)111,
83(1)57,
83(2)189,
86(1)81,
86(2)233,
87(2)315,
88(2)269,
93(2)185,
93(2)227,
94(1)101,
94(1)141,
94(2)335,
95(2)307,
97(1)143,
97(2)233,
100(1)157,
100(2)267,
100(2)325,
103(1)39,
105(1)7,
109(1)181,
110(1)1,
111(1)89,
112(1)145,
112(2)413,
113(1)93,
118(2)301,
120(1)69,
120(2)197,
121(1)309,
126(2)183,
129(1)123,
131(2)271,
132(1)259
- correctness,
70(1)73,
73(2)155,
75(1)111,
75(3)263,
80(2)263,
80(2)319,
83(1)157,
89(1)179,
97(1)67,
100(2)365,
104(1)89,
104(2)313,
107(2)305,
111(1)3,
118(2)99,
119(1)23,
119(1)127,
120(1)123,
129(1)123
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(1)137,
81(2)169,
82(1)19,
84(1)127,
84(2)199,
85(1)33,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
113(1)119,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
126(2)183,
127(1)25,
128(1)179,
133(2)307,
134(2)329,
134(2)365,
134(2)387,
135(1)139
- lower,
74(3)313,
81(2)237,
82(1)113,
82(1)157,
83(2)169,
92(1)191,
96(2)411,
97(2)285,
102(2)215,
106(2)351,
108(2)271,
111(1)59,
112(2)355,
112(2)419,
113(1)75,
116(2)415,
119(2)267,
123(2)389,
125(2)373,
127(2)395,
128(1)63,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)163,
130(1)175,
130(1)203,
131(2)243,
131(2)331,
133(1)23,
134(1)253
- necessary,
83(1)57,
88(2)269,
93(2)185,
94(1)101,
95(2)307,
100(2)267,
103(1)39,
129(1)123
- sequence,
71(3)381,
71(3)419,
73(1)91,
73(2)121,
74(1)71,
74(3)341,
75(3)223,
76(1)115,
76(2)309,
79(2)275,
80(2)263,
83(1)131,
83(2)205,
83(2)219,
87(2)251,
90(2)391,
92(1)3,
94(2)161,
94(2)215,
94(2)373,
95(2)231,
98(2)163,
100(1)105,
102(2)253,
103(1)137,
103(2)191,
107(1)31,
108(2)385,
113(2)349,
114(1)63,
115(1)63,
117(1)289,
119(2)345,
119(2)363,
122(1)137,
123(1)3,
123(1)55,
123(1)61,
123(2)239,
123(2)351,
126(2)183,
127(2)351,
129(2)263,
129(2)369,
129(2)385,
132(1)1,
132(1)37,
132(1)337
- shape,
98(1)65
- sufficient,
70(1)151,
70(2)179,
72(1)27,
83(1)71,
86(2)233,
88(2)269,
93(2)185,
94(1)1,
94(1)101,
94(1)141,
95(2)307,
97(1)143,
100(1)157,
100(2)267,
103(1)39,
112(1)145,
113(1)93,
118(2)301,
120(1)69,
129(1)123,
132(1)259
- testing,
74(1)19,
80(2)227,
80(2)263,
80(2)319,
84(2)225,
87(1)97,
88(1)59,
94(1)141,
94(2)237,
95(1)1,
95(2)263,
96(1)157,
99(2)265,
103(2)191,
103(2)205,
105(1)129,
106(1)87,
107(2)305,
113(1)93,
118(2)99,
119(1)23,
119(1)173,
119(1)z,
119(2)331,
120(1)69,
120(1)83,
120(1)123,
125(1)61,
125(1)91,
125(1)111,
125(1)131,
128(1)99,
128(1)127,
128(1)159,
128(1)179,
128(1)241,
129(2)397,
131(1)95,
134(2)287
- weight,
80(2)337,
93(2)303,
94(2)295,
127(2)199,
131(2)415,
135(2)345
- worst-case,
74(3)273,
84(1)127,
100(1)185,
103(2)283,
117(1)187,
120(2)197,
128(1)75,
129(2)397,
132(1)1