Entry Larson:1982:EWC from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

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