Last update: Sat Jan 6 02:03:49 MST 2018
@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",
}