Entry Fagerberg:1996:BST from lncs1996a.bib
Last update: Mon Mar 13 02:22:27 MDT 2017
Top |
Symbols |
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{Fagerberg:1996:BST,
author = "R. Fagerberg",
title = "Binary Search Trees: How Low Can You Go?",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1097",
pages = "428--??",
year = "1996",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Aug 14 09:38:08 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1996a.bib",
acknowledgement = ack-nhfb,
}
Related entries
- Binary,
1027(0)166,
1046(0)491,
1081(0)14
- how,
1027(0)373,
1029(0)115,
1039(0)89,
1051(0)1,
1057(0)535,
1060(0)121,
1063(0)232,
1070(0)399,
1072(0)286,
1077(0)230,
1085(0)716,
1086(0)493
- Low,
1027(0)254,
1029(0)144,
1046(0)99,
1070(0)268,
1072(0)135,
1072(0)233
- search,
1050(0)35,
1050(0)67,
1054(0)248,
1055(0)70,
1059(0)135,
1063(0)333,
1064(0)452,
1064(0)514,
1071(0)295,
1071(0)312,
1075(0)75,
1079(0)178,
1082(0)131,
1090(0)371,
1099(0)598
- tree,
1027(0)64,
1027(0)166,
1040(0)217,
1041(0)24,
1041(0)513,
1046(0)157,
1046(0)581,
1048(0)1,
1059(0)44,
1059(0)87,
1059(0)135,
1060(0)294,
1073(0)196,
1075(0)102,
1075(0)116,
1075(0)220,
1075(0)234,
1075(0)361,
1075(0)384,
1081(0)121,
1081(0)349,
1084(0)105,
1084(0)132,
1090(0)106,
1090(0)219,
1090(0)361,
1092(0)86,
1097(0)66,
1097(0)149,
1097(0)161,
1097(0)212,
1097(0)246,
1097(0)259,
1099(0)312,
1099(0)538,
1099(0)550