Entry Frost:1982:SNB 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{Frost:1982:SNB,
  author =       "R. A. Frost and M. M. Peterson",
  title =        "A Short Note on Binary Search Trees",
  journal =      j-COMP-J,
  volume =       "25",
  number =       "1",
  pages =        "158--158",
  month =        feb,
  year =         "1982",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/25.1.158",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:12 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/25/1.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/",
  URL =          "http://comjnl.oxfordjournals.org/content/25/1/158.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/158.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic); C6120 (File organisation)",
  corpsource =   "Dept. of Computer Sci., Univ. of Strathclyde, Glasgow,
                 UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "(mathematics); binary search trees; data organization;
                 deletion; file organisation; information retrieval;
                 perfectly balanced trees; pseudo-random trees; record
                 insertion; trees",
  treatment =    "P Practical",
}

Related entries