Entry Zaki:1984:ASS 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{Zaki:1984:ASS,
  author =       "Ahmed S. Zaki",
  title =        "Algorithm 119: a space saving insertion algorithm for
                 $2$-$3$ trees",
  journal =      j-COMP-J,
  volume =       "27",
  number =       "4",
  pages =        "368--372",
  month =        nov,
  year =         "1984",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/27.4.368",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Mar 25 13:51:56 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/368.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/369.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/370.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/371.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_04/tiff/372.tif",
  abstract =     "This paper consists of two parts. The first part
                 describes a new space saving top-down insertion
                 algorithm for 2-3 trees. It also compares the average
                 insertion time per key and storage requirements of the
                 proposed algorithm with those of the conventional ones
                 based on simulation results. The second part presents a
                 FORTRAN code of the algorithm.",
  acknowledgement = ack-nhfb,
  affiliation =  "Coll of William \& Mary, Sch of Business
                 Administration, Williamsburg, VA, USA",
  affiliationaddress = "Coll of William \& Mary, Sch of Business
                 Administration, Williamsburg, VA, USA",
  classcodes =   "C1160 (Combinatorial mathematics); C6120 (File
                 organisation)",
  classification = "723; 921",
  corpsource =   "Sch. of Bus. Adm., Coll. of William and Mary,
                 Williamsburg, VA, USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "2-3; 2-3 trees; Algorithms; computer programming;
                 computer programs; data structures; fortran code;
                 FORTRAN code; FORTRAN listings; insertion algorithm;
                 mathematical techniques --- Trees; space saving
                 insertion algorithm; top-down insertion algorithm;
                 trees; trees (mathematics)",
  treatment =    "P Practical",
}

Related entries