Entry Larson:1982:EWC 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{Larson:1982:EWC,
author = "Per-{\AA}ke Larson",
title = "Expected Worst-Case Performance of Hash Files",
journal = j-COMP-J,
volume = "25",
number = "3",
pages = "347--352",
month = aug,
year = "1982",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/25.3.347",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:13 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/25/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/25/3/347.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/347.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/348.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/349.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/350.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/351.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_03/tiff/352.tif",
acknowledgement = ack-nhfb,
classcodes = "C6120 (File organisation)",
classification = "723",
corpsource = "Dept. of Information Processing, Abo Akad., Abo,
Finland",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming; hash files; linear probing;
longest; overflow handling schemes; probe sequence;
separate chaining; table lookup; worst-case
performance",
remark = "Given a suitable hash function, performance is never
disastrous.",
review = "ACM CR 40,399",
treatment = "P Practical",
}
Related entries
- case, worst-,
27(3)201,
28(1)5,
29(5)390,
31(3)276
- chaining,
23(2)115,
29(5)436
- expected,
28(4)426,
29(1)36,
31(6)496,
32(3)246
- files,
23(3)287,
25(2)242,
26(1)43,
27(4)321,
28(2)117,
28(4)412,
28(4)414,
29(2)167,
30(1)80,
30(3)249,
30(4)343,
30(4)362,
30(6)529,
30(6)535,
31(6)565,
z(z)z
- handling,
23(2)147,
24(1)3,
24(1)17,
24(1)42,
24(2)97,
24(2)130,
25(4)448,
25(4)486,
26(3)205,
28(2)117,
29(5)477-1,
30(3)277,
30(6)569,
31(1)61,
31(2)133,
31(6)503,
31(6)553,
31(6)557,
31(6)561,
32(1)13,
32(1)16,
32(3)238,
32(3)241,
32(5)386,
32(6)494,
32(6)505
- hash,
23(2)188,
24(2)130,
24(4)383-1,
25(4)486,
27(3)218,
28(3)313,
28(4)412,
29(2)167,
29(5)430,
z(z)z
- Larson, Per-Åke,
28(3)319
- linear,
23(1)78,
24(2)156,
25(1)56,
27(4)373,
28(1)73,
28(1)78,
28(2)142,
28(3)319,
28(4)412,
30(2)176,
30(4)372,
31(3)279,
31(6)567,
32(3)228,
32(4)362,
32(6)571
- longest,
32(3)228
- lookup,
23(1)37,
23(2)188,
25(4)478,
25(4)486,
27(3)225,
28(1)68,
28(3)313,
29(5)430
- overflow,
23(2)153,
28(3)319,
28(3)330,
29(2)167,
29(5)416,
30(6)529,
z(z)z
- performance,
24(2)132,
24(4)343,
24(4)347,
24(4)384-2,
25(1)74,
25(2)169,
25(2)188,
25(2)193,
25(2)227,
25(4)486,
26(1)93,
26(2)113,
27(1)27,
27(2)143,
27(2)165,
27(3)201,
27(3)238,
27(3)270,
28(2)142,
28(2)179,
28(3)231,
28(3)309,
28(3)319,
28(3)330,
28(4)409,
28(4)426,
28(5)501,
29(1)47,
29(2)118,
29(4)289,
29(5)390,
29(5)396,
29(5)451,
30(4)289,
30(4)362,
30(6)519,
30(6)535,
31(1)12,
31(3)276,
31(4)304,
31(5)409,
31(5)437,
31(5)445,
31(6)490,
31(6)565,
32(1)16,
32(2)142,
32(2)152,
32(3)228,
32(3)252,
32(4)333,
32(5)437,
32(5)453
- probe,
28(3)313
- schemes,
25(4)478,
29(4)322,
30(4)298,
31(3)209,
31(3)258,
32(3)238
- separate,
32(2)127
- sequence,
23(1)46,
25(1)116,
25(4)493,
27(2)176,
28(2)170,
29(1)17,
29(1)36,
29(2)171,
30(5)420,
31(3)220,
32(4)370,
32(6)541
- table,
23(1)37,
23(2)188,
24(2)130,
24(4)383-1,
25(2)239,
25(4)448,
25(4)478,
25(4)486,
27(3)225,
27(3)230,
28(1)54,
28(1)68,
28(3)313,
28(4)366,
28(4)412,
29(5)430,
30(4)298,
31(4)296,
31(6)481
- worst-case,
27(3)201,
28(1)5,
29(5)390,
31(3)276