Entry Karpinski:1997:CCO 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{Karpinski:1997:CCO,
author = "Marek Karpinski and Lawrence L. Larmore and Wojciech
Rytter",
title = "Correctness of constructing optimal alphabetic trees
revisited",
journal = j-THEOR-COMP-SCI,
volume = "180",
number = "1--2",
pages = "309--324",
day = "10",
month = jun,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=180&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=180&issue=1-2&aid=2496",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6110F
(Formal methods); C6150G (Diagnostic, testing,
debugging and evaluating systems)",
corpsource = "Dept. of Comput. Sci., Bonn Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "correctness proofs; Garsia-Wachs algorithm; Hu-Tucker
algorithm; optimal alphabetic trees; program
verification; programming theory",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- alphabetic,
188(1)1
- C6110F,
138(1)3,
138(1)169,
138(1)211,
139(1)27,
139(1)275,
140(1)73,
140(1)95,
140(1)179,
142(1)3,
150(1)111,
150(1)161,
152(1)67,
152(1)91,
152(1)139,
152(2)269,
156(1)177,
159(2)245,
165(1)3,
166(1)263,
167(1)3,
167(1)47,
167(1)193,
169(1)39,
170(1)47,
170(1)245,
173(1)49,
173(2)393,
173(2)445,
173(2)513,
176(1)235,
177(2)425,
177(2)459,
177(2)487,
179(1)273,
179(1)397,
181(1)195,
183(2)157,
183(2)215,
183(2)253,
184(1)145,
185(2)393,
186(1)43,
186(1)135,
189(1)179,
189(1)239,
190(2)115,
192(1)31,
193(1)197,
194(1)243,
194(1)243,
194(1)245-1
- C6150G,
139(1)275,
142(2)257,
150(1)161,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
177(1)183,
177(2)407,
183(2)215,
183(2)229,
183(2)253,
186(1)135,
195(2)259,
196(1)241
- constructing,
154(2)225,
161(1)307,
177(1)73,
187(1)3,
194(1)244-1
- correctness,
139(1)275,
140(1)139,
151(1)195,
152(2)219,
156(1)177,
159(2)245,
166(1)1,
166(1)101,
167(1)193,
169(1)81,
173(1)235,
177(1)183,
195(2)259,
197(1)245-1,
199(1)25,
199(1)87,
224(1)115
- debugging,
139(1)275,
142(2)257,
150(1)161,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
177(1)183,
177(2)407,
183(2)215,
183(2)229,
183(2)253,
186(1)135,
195(2)259,
196(1)241
- Diagnostic,
139(1)275,
142(2)257,
150(1)161,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
177(1)183,
177(2)407,
183(2)215,
183(2)229,
183(2)253,
186(1)135,
195(2)259,
196(1)241
- evaluating,
139(1)275,
142(2)257,
150(1)161,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
177(1)183,
177(2)407,
183(2)215,
183(2)229,
183(2)253,
186(1)135,
195(2)259,
196(1)241
- Karpinski, Marek,
154(1)23,
157(1)91,
157(2)259,
205(1)243
- Larmore, Lawrence L.,
197(1)189
- 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,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
196(1)395,
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
- proof,
135(1)67,
138(1)113,
138(2)243,
139(1)355,
140(1)95,
141(1)69,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
191(1)215,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)245-2,
197(1)246-1,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- revisited,
181(1)45,
228(1)211
- Rytter, Wojciech,
143(2)343,
147(1)19,
197(1)189,
205(1)243,
218(1)123,
218(1)197
- testing,
139(1)275,
142(2)257,
146(1)341,
150(1)161,
162(1)133,
164(1)107,
167(1)131,
167(1)193,
173(1)113,
173(1)209,
173(1)235,
174(1)231,
175(2)373,
176(1)1,
177(1)183,
177(2)407,
180(1)17,
180(1)217,
182(1)159,
182(1)203,
183(2)215,
183(2)229,
183(2)253,
185(2)259,
186(1)135,
188(1)79,
192(1)55,
195(2)259,
196(1)241,
196(1)319,
196(1)347,
197(1)171,
197(1)171-1,
201(1)85
- verification,
138(1)169,
138(2)391,
139(1)27,
139(1)275,
140(1)95,
141(1)283,
142(2)179,
142(2)257,
149(2)361,
150(1)161,
151(1)125,
151(2)487,
152(1)139,
153(1)95,
156(1)177,
165(1)3,
165(1)57,
165(1)97,
166(1)1,
166(1)173,
167(1)193,
168(1)53,
169(1)81,
170(1)47,
170(1)245,
173(1)49,
174(1)217,
176(1)111,
176(1)235,
177(1)183,
177(2)407,
177(2)425,
177(2)459,
178(1)237,
179(1)353,
179(1)397,
180(1)17,
183(2)215,
183(2)253,
185(2)393,
186(1)135,
189(1)229,
192(1)31,
195(2)259,
216(1)213,
220(2)377