Last update: Fri Mar 23 02:19:19 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{Peng:1998:LTA,
author = "S.-L. Peng and C.-W. Ho and T.-S. Hsu and M.-T. Ko",
title = "A Linear-Time Algorithm for Constructing an Optimal
Node-Search Strategy of a Tree",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1449",
pages = "279--??",
year = "1998",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Sat Oct 10 14:40:24 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1998a.bib",
acknowledgement = ack-nhfb,
}
Related entries
- Constructing,
1394(0)374,
1394(0)378,
1416(0)557,
1423(0)555,
1448(0)126,
1449(0)299
- Hsu, T.-S.,
1449(0)241
- Linear-Time,
1443(0)53
- optimal,
1366(0)322,
1367(0)235,
1373(0)84,
1373(0)139,
1373(0)432,
1373(0)477,
1377(0)39,
1383(0)204,
1388(0)341,
1388(0)534,
1388(0)987,
1398(0)77,
1398(0)101,
1401(0)315,
1406(0)175,
1407(0)796,
1416(0)163,
1424(0)537,
1424(0)557,
1430(0)17,
1432(0)59,
1432(0)181,
1443(0)327,
1447(0)693,
1449(0)15,
1449(0)95,
1449(0)269,
1449(0)309
- strategy,
1370(0)114,
1383(0)50,
1389(0)175,
1390(0)z,
1393(0)261,
1395(0)458,
1397(0)320,
1398(0)316,
1401(0)294,
1401(0)305,
1415(0)169,
1416(0)85,
1416(0)479,
1416(0)619,
1418(0)30,
1418(0)139,
1424(0)37,
1430(0)43,
1435(0)94,
1441(0)231,
1443(0)327,
1447(0)33,
1447(0)147,
1447(0)219,
1447(0)493,
1449(0)75
- Time, Linear-,
1443(0)53
- tree,
1373(0)309,
1373(0)320,
1373(0)421,
1373(0)432,
1373(0)455,
1373(0)566,
1379(0)196,
1379(0)256,
1380(0)42,
1380(0)282,
1380(0)374,
1394(0)234,
1394(0)271,
1394(0)409,
1395(0)99,
1398(0)25,
1398(0)125,
1398(0)131,
1398(0)190,
1401(0)658,
1414(0)157,
1416(0)469,
1418(0)363,
1422(0)23,
1422(0)315,
1422(0)315-1,
1424(0)499,
1424(0)506,
1424(0)517,
1432(0)222,
1433(0)187,
1433(0)199,
1443(0)164,
1443(0)271,
1443(0)409,
1443(0)544,
1443(0)670,
1444(0)33,
1448(0)65,
1448(0)80,
1448(0)140,
1449(0)35,
1449(0)299,
1450(0)702