Entry Culberson:1989:EBB from compj1980.bib
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{Culberson:1989:EBB,
author = "J. Culberson and J. I. Munro",
title = "Explaining the behaviour of binary search trees under
prolonged updates: a model and simulations",
journal = j-COMP-J,
volume = "32",
number = "1",
pages = "68--75",
month = feb,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.1.68",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68U20 (68-04 68P10 68R10)",
MRnumber = "984 924",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/32/1/68.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/68.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/69.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/70.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/71.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/72.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/73.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/74.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_01/tiff/75.tif",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Alberta Univ.",
affiliationaddress = "Edmonton, Alberta, Can",
classcodes = "C4250 (Database theory); C6160 (Database management
systems (DBMS)); C6120 (File organisation); C1160
(Combinatorial mathematics)",
classification = "723; 921; C1160 (Combinatorial mathematics); C4250
(Database theory); C6120 (File organisation); C6160
(Database management systems (DBMS))",
corpsource = "Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta.,
Canada",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Asymptotic average search path length; asymptotic
average search path length; average path length;
Average path length, Data Processing; Binary search
trees; Binary Search Trees; binary search trees;
Computer Programming--Algorithms; Computer Simulation;
Data Structures; data structures; database; database
management systems; Database Systems; Deletion
algorithms; Deletion Algorithms; deletion algorithms;
Long-term behaviour; long-term behaviour; Long-term
deterioration; long-term deterioration; Mathematical
Techniques--Trees; Prolonged updates; Prolonged
Updates; prolonged updates; Symmetry; symmetry; theory;
trees (mathematics)",
thesaurus = "Data structures; Database management systems; Database
theory; Trees [mathematics]",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68P10,
26(4)293,
27(3)218,
27(3)270,
28(1)54,
28(4)417,
28(4)426,
29(1)52,
29(5)436,
30(6)565,
31(6)490,
31(6)553,
31(6)557,
31(6)561
- 68R10,
28(1)78,
30(4)298,
30(6)569,
31(1)61,
31(6)564,
32(5)470,
32(5)474
- Algorithms;, Programming-,
31(6)553,
31(6)561,
31(6)570,
32(1)36,
32(1)45,
32(1)91
- average,
23(2)161,
23(2)188,
26(2)113,
26(2)188,
27(4)368-1,
28(3)330,
29(2)167,
30(2)149,
30(6)535,
32(3)220,
z(z)z
- behaviour,
26(2)154,
27(3)238,
28(1)9,
28(3)257,
29(1)47,
30(2)168,
30(5)437,
32(4)290,
32(4)297,
32(5)413,
32(6)541
- binary,
23(3)248,
23(3)269,
23(4)332,
24(1)42,
25(1)140,
25(1)158,
25(3)316,
25(4)471,
26(2)106,
26(2)154,
26(2)187,
26(3)193,
27(2)178,
28(4)417,
28(4)426,
28(5)538,
29(1)36,
29(2)103,
29(2)171,
29(4)368,
30(2)176,
30(4)308,
30(6)541,
30(6)565,
31(2)141,
31(4)330,
31(6)564,
31(6)565,
32(1)45,
32(1)63,
32(1)76,
32(3)246,
32(5)470
- C1160,
31(6)564,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- C4250,
31(6)490,
31(6)565,
32(1)76
- C6120,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(3)228,
32(4)323,
32(4)351,
32(6)494
- C6160,
31(6)490,
32(4)333
- combinatorial,
23(1)73,
23(4)332,
25(1)48,
26(2)97,
26(4)336,
27(2)151,
28(4)439,
30(3)258,
30(3)282,
30(5)433,
31(1)65,
31(4)304,
31(6)564,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- DBMS,
23(1)53,
25(2)169,
25(3)368,
25(4)448,
25(4)486,
26(3)218,
26(3)228,
27(3)209,
27(3)218,
28(2)170,
28(4)372,
28(4)391,
30(6)485,
31(2)99,
31(2)182,
31(6)490,
31(6)550,
31(6)570,
32(1)55,
32(1)63,
32(1)90,
32(4)333
- deletion,
25(1)158,
26(3)239,
28(2)179,
28(4)417,
29(5)436,
31(5)474,
32(3)194
- length,
23(1)37,
23(2)161,
25(1)116,
25(3)368,
28(3)291,
28(3)319,
28(4)379,
29(2)167,
31(3)248,
32(3)246,
z(z)z
- long-term,
32(2)152
- 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,
27(4)368-1,
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)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,
27(4)368-1,
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)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- organisation,
23(1)37,
23(3)207,
24(1)29,
24(4)290,
25(1)158,
25(2)169,
25(2)193,
25(2)239,
25(3)327,
25(3)368,
26(1)43,
26(3)196,
27(2)143,
27(3)218,
27(3)270,
27(3)284,
27(4)321,
27(4)334,
28(1)54,
28(2)179,
28(3)203,
28(3)243,
28(3)291,
28(3)313,
28(3)319,
28(3)330,
28(4)391,
28(4)412,
28(4)414,
28(4)417,
28(4)426,
28(5)524,
29(1)52,
29(2)167,
29(3)277,
29(4)368,
29(5)436,
29(6)522,
30(1)80,
30(6)529,
30(6)535,
30(6)565,
31(1)41,
31(5)426,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(3)212,
32(3)228,
32(4)323,
32(4)351,
32(6)494
- path,
23(2)161,
23(2)188,
23(3)207,
27(2)178,
29(5)423,
29(6)553,
30(1)43,
30(1)77,
31(1)41,
32(1)24,
32(3)194,
32(3)228
- Programming--Algorithms,
31(6)553,
31(6)561,
31(6)570,
32(1)36,
32(1)45,
32(1)91
- search,
23(3)248,
23(3)256,
24(1)29,
25(1)2,
25(1)126,
25(1)158,
25(2)199,
25(3)353,
26(2)106,
26(2)154,
27(4)373,
28(2)105,
28(2)179,
28(3)264,
28(3)313,
28(3)319,
29(1)17,
29(1)36,
29(1)52,
29(1)76,
29(2)167,
29(2)176,
29(4)368,
29(5)436,
30(6)565,
31(2)175,
32(3)212,
32(6)567,
z(z)z
- 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,
27(4)368-1,
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(6)541,
32(6)563
- symmetry,
25(3)388
- Techniques--Trees,
31(6)490,
31(6)564,
32(1)76
- term, long-,
32(2)152
- Trees;, Techniques-,
31(6)490,
31(6)564,
32(1)76
- update,
25(1)126,
28(1)54,
28(2)154,
28(5)518,
29(3)269,
31(4)344