Last update: Sat Jan 6 02:03:49 MST 2018
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{Zaki:1984:ASS,
author = "Ahmed S. Zaki",
title = "Algorithm 119: a space saving insertion algorithm for
$2$-$3$ trees",
journal = j-COMP-J,
volume = "27",
number = "4",
pages = "368--372",
month = nov,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.4.368",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Mar 25 13:51:56 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/368.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/369.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/370.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/371.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/372.tif",
abstract = "This paper consists of two parts. The first part
describes a new space saving top-down insertion
algorithm for 2-3 trees. It also compares the average
insertion time per key and storage requirements of the
proposed algorithm with those of the conventional ones
based on simulation results. The second part presents a
FORTRAN code of the algorithm.",
acknowledgement = ack-nhfb,
affiliation = "Coll of William \& Mary, Sch of Business
Administration, Williamsburg, VA, USA",
affiliationaddress = "Coll of William \& Mary, Sch of Business
Administration, Williamsburg, VA, USA",
classcodes = "C1160 (Combinatorial mathematics); C6120 (File
organisation)",
classification = "723; 921",
corpsource = "Sch. of Bus. Adm., Coll. of William and Mary,
Williamsburg, VA, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "2-3; 2-3 trees; Algorithms; computer programming;
computer programs; data structures; fortran code;
FORTRAN code; FORTRAN listings; insertion algorithm;
mathematical techniques --- Trees; space saving
insertion algorithm; top-down insertion algorithm;
trees; trees (mathematics)",
treatment = "P Practical",
}
Related entries
- 26-4-381a-381,
27(2)179,
28(2)117,
28(3)340
- $2$,
25(3)327,
31(1)71
- $3$,
27(4)334
- average,
23(2)161,
23(2)188,
26(2)113,
26(2)188,
28(3)330,
29(2)167,
30(2)149,
30(6)535,
32(1)68,
32(3)220,
z(z)z
- based,
23(2)124,
23(2)142,
25(1)105,
25(4)471,
26(1)10,
27(1)67,
27(2)127,
28(3)298,
29(4)340,
30(3)249,
30(5)469,
31(2)155,
31(6)481,
32(2)175,
32(3)241,
32(4)297,
32(5)453,
32(5)461
- code,
23(1)46,
23(1)53,
23(1)66,
23(2)147,
23(3)212,
23(3)223,
24(4)324,
25(3)316,
25(4)442,
26(4)303,
26(4)375,
27(3)246,
27(4)354,
28(3)343,
28(4)379,
29(1)12,
29(1)60,
29(4)307,
29(5)472,
29(6)573,
30(1)87,
30(2)149,
30(6)541,
30(6)569,
31(6)517,
32(2)152,
32(3)228,
32(3)241,
32(3)246,
32(3)276
- conventional,
30(5)437,
32(2)152
- describe,
26(3)235,
29(3)277,
31(6)496,
32(1)13,
32(2)108,
32(2)142
- down, top-,
23(4)317,
28(1)17,
31(1)51
- first,
23(2)186,
24(1)16,
24(2)97,
25(1)32,
25(2)199,
32(1)76,
32(2)162,
32(4)290
- FORTRAN,
23(2)142,
24(1)87,
25(1)48,
25(1)84,
25(2)218,
25(3)316,
26(1)92,
26(2)184,
26(4)344,
27(2)179,
27(2)184,
28(2)117,
28(3)340,
30(3)276-1
- insertion,
23(1)61,
25(1)158,
28(2)179,
28(3)319,
28(4)417,
28(4)426,
29(3)282,
29(5)436,
30(6)529
- key,
23(2)188,
25(3)327,
25(4)478,
25(4)486,
27(3)218,
27(3)270,
28(3)291,
28(3)309,
28(3)343,
29(2)176,
29(3)277,
29(4)368,
30(3)276-2,
30(6)535,
30(6)565
- listing,
27(4)373,
28(2)117,
28(3)340,
28(3)343,
29(2)176,
30(3)277,
30(6)569,
31(6)553,
31(6)557
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)178,
27(2)184,
27(3)218,
27(3)225,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- new,
23(1)3,
23(1)28,
23(4)324,
24(1)85,
24(4)320,
25(2)176,
27(4)310,
28(2)184,
28(3)291,
29(1)33,
29(5)467,
29(6)522,
32(5)470
- one,
23(2)165,
28(3)313,
28(5)530,
30(5)437,
31(6)496,
32(1)13,
32(2)152,
32(2)175,
32(5)461
- paper,
23(1)33,
24(1)95,
25(4)471,
26(2)109,
26(3)235,
27(3)288-2,
28(1)1,
28(2)104-2,
28(4)446-1,
29(3)201,
29(3)277,
29(4)289,
29(5)477-1,
31(5)457,
31(6)496,
32(2)98,
32(2)142,
32(2)152,
32(2)175,
32(5)422
- part,
23(3)211,
23(4)298,
26(1)25,
26(4)375,
27(3)225,
27(4)362,
27(4)375,
29(3)201,
32(2)142
- per,
32(3)212
- present,
24(4)320,
32(2)127,
32(2)162
- proposed,
25(4)471,
26(1)60,
29(4)289,
30(5)437,
32(2)162,
32(5)461
- requirement,
25(2)235,
26(2)113,
27(2)143,
28(1)73,
28(2)97,
28(2)128,
28(4)414,
29(5)423,
30(1)16,
31(5)426,
31(6)553,
32(1)1,
32(3)212,
32(3)252
- result,
24(4)320,
29(3)212,
30(5)437,
31(3)220,
31(3)253,
32(5)461
- saving,
23(2)165,
30(5)458
- second,
23(3)274,
24(2)180,
26(2)192-1,
32(2)142,
32(3)241
- simulation,
23(2)142,
23(3)233,
24(1)25,
24(2)191,
25(1)84,
25(3)399,
26(2)134,
27(1)72,
27(3)254,
27(4)362,
28(2)138,
28(4)357,
28(5)496,
28(5)498,
29(2)118,
29(2)127,
29(6)522,
30(3)201,
30(3)258,
31(1)9,
31(1)41,
31(2)147,
31(4)364,
31(5)420,
31(6)517,
32(1)68,
32(6)541,
32(6)563
- space,
24(4)316,
25(1)45,
25(4)486,
26(1)15,
26(3)224,
28(1)73,
28(3)330,
28(4)439,
29(3)269,
30(1)87,
30(2)119,
30(2)163,
30(3)223,
30(4)362,
30(4)372,
31(1)17,
31(1)56,
31(2)110,
31(3)279,
31(4)296,
31(4)358,
32(3)228,
32(4)362
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)243,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474
- top-down,
23(4)317,
28(1)17,
31(1)51
- two,
23(2)142,
24(4)339,
24(4)343,
25(2)169,
26(3)247,
27(2)176,
27(3)270,
28(2)184,
28(3)313,
29(6)506,
30(4)316,
30(5)437,
31(5)474,
32(2)98,
32(3)238