Entry Hatter:1984:AGN 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{Hatter:1984:AGN,
  author =       "D. J. Hatter",
  title =        "Algorithm 116: a generalized non-recursive binary tree
                 traversal algorithm",
  journal =      j-COMP-J,
  volume =       "27",
  number =       "2",
  pages =        "178--179",
  month =        may,
  year =         "1984",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/27.2.178",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Mon Jul 26 14:07:48 1999",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/",
  URL =          "http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/178.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/179.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Systems and Computing, North East London
                 Polytech., Dagenham, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algebraic string; algorithm theory; binary; endorder
                 tree traversal; postorder tree traversal; preorder tree
                 traversal; traversal path; tree traversal; trees
                 (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

Related entries