Entry Friedman:1978:FC from complngs.bib

Last update: Thu Jun 20 02:00:37 MDT 2019                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Friedman:1978:FC,
  author =       "Daniel P. Friedman and David S. Wise",
  title =        "Functional Combination",
  journal =      j-COMP-LANGS,
  volume =       "3",
  number =       "1",
  pages =        "31--35",
  month =        "????",
  year =         "1978",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory)",
  classification = "723; 921",
  corpsource =   "Computer Sci. Dept., Indiana Univ., Bloomington, IN,
                 USA",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "algorithm; batch probing; batch-probing; binary;
                 combination; computer programming --- Subroutines;
                 computer programming languages; functional; functional
                 combination; list of hits; list of keys; lists;
                 mathematical techniques --- Trees; programming theory;
                 recursive; recursive functions; search trees; semantic
                 interpretation; trees (mathematics)",
  treatment =    "T Theoretical or Mathematical",
}

Related entries