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{Lyon:1985:AHT,
author = "Gordon Lyon",
title = "Achieving Hash Table Searches in One or Two Bucket
Probes",
journal = j-COMP-J,
volume = "28",
number = "3",
pages = "313--318",
month = jul,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.3.313",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:18 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/28/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/28/3/313.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/313.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/314.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/315.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/316.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/317.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/318.tif",
acknowledgement = ack-nhfb,
affiliation = "NBS, Inst for Computer Sciences \& Technology,
Gaithersburg, MD, USA",
affiliationaddress = "NBS, Inst for Computer Sciences \& Technology,
Gaithersburg, MD, USA",
classcodes = "C4240 (Programming and algorithm theory); C6120 (File
organisation)",
classification = "723",
corpsource = "Inst. for Comput. Sci. and Technol., NBS,
Gaithersburg, MD, USA",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "alternation tree hashing; alternation-tree hashing;
bucket; bucket probes; computer programming ---
Algorithms; data processing; file organisation; File
Organization; hash table searches; lookups;
open-addressing hash tables; probes; programming
theory; serviceability; table; trees (mathematics)",
treatment = "T Theoretical or Mathematical",
}
Related entries
- hash,
23(2)188,
24(2)130,
24(4)383-1,
25(3)347,
25(4)486,
27(3)218,
28(4)412,
29(2)167,
29(5)430,
z(z)z
- hashing,
25(3)358,
25(4)478,
25(4)486,
27(3)218,
28(1)54,
28(3)319,
28(3)330,
29(3)277,
29(5)436,
30(6)535
- lookup,
23(1)37,
23(2)188,
25(3)347,
25(4)478,
25(4)486,
27(3)225,
28(1)68,
29(5)430
- 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(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
- one,
23(2)165,
27(4)368-1,
28(5)530,
30(5)437,
31(6)496,
32(1)13,
32(2)152,
32(2)175,
32(5)461
- 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)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(1)68,
32(3)212,
32(3)228,
32(4)323,
32(4)351,
32(6)494
- organization,
25(1)158,
25(2)169,
25(2)207,
25(3)327,
25(3)368,
27(2)143,
27(3)284,
27(3)284-1,
27(4)321,
28(3)319,
28(3)330,
28(4)414,
28(5)524,
29(1)52,
29(3)277,
29(4)368,
30(1)80,
30(4)343,
30(6)529,
30(6)535,
31(1)41,
31(3)253,
31(6)565,
32(3)262
- probe,
25(3)347
- 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)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(1)68,
32(3)212,
32(6)567,
z(z)z
- table,
23(1)37,
23(2)188,
24(2)130,
24(4)383-1,
25(2)239,
25(3)347,
25(4)448,
25(4)478,
25(4)486,
27(3)225,
27(3)230,
28(1)54,
28(1)68,
28(4)366,
28(4)412,
29(5)430,
30(4)298,
31(4)296,
31(6)481
- two,
23(2)142,
24(4)339,
24(4)343,
25(2)169,
26(3)247,
27(2)176,
27(3)270,
27(4)368-1,
28(2)184,
29(6)506,
30(4)316,
30(5)437,
31(5)474,
32(2)98,
32(3)238