Entry Wright:1982:SVD 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{Wright:1982:SVD,
  author =       "William E. Wright",
  title =        "Single Versus Double Buffering in Constrained
                 Merging",
  journal =      j-COMP-J,
  volume =       "25",
  number =       "2",
  pages =        "227--230",
  month =        may,
  year =         "1982",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/25.2.227",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:12 MST 2012",
  bibsource =    "Compendex database; Database/Graefe.bib;
                 http://comjnl.oxfordjournals.org/content/25/2.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/",
  URL =          "http://comjnl.oxfordjournals.org/content/25/2/227.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/227.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/228.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/229.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_02/tiff/230.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C6130 (Data handling techniques)",
  classification = "723",
  corpsource =   "Dept. of Computer Sci., Southern Illinois Univ.,
                 Carbondale, IL, USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "complete single buffering; computer systems
                 programming; constrained merging; double buffering;
                 external sort; internal memory; merging; Sort sorting
                 I/O performance merge; sorting",
  treatment =    "P Practical",
}

Related entries