Entry Pelin:1987:BEC from tcs1985.bib

Last update: Thu Sep 27 02:46:57 MDT 2018                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{Pelin:1987:BEC,
  author =       "A. Pelin and J. H. Gallier",
  title =        "Building exact computation sequences",
  journal =      j-THEOR-COMP-SCI,
  volume =       "53",
  number =       "1",
  pages =        "125--150",
  month =        "",
  year =         "1987",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  conflocation = "Nice, France; March 1986",
  conftitle =    "Eleventh Colloquium on Trees in Algebra and
                 Programming",
  corpsource =   "Dept. of Math. Sci., Florida Int. Univ., Miami, FL,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "axiom systems; computational complexity; exact
                 computation sequences; free algebra; rewrite rules;
                 theorem proving; top-down reduction extension",
  pubcountry =   "Netherlands A05",
  treatment =    "T Theoretical or Mathematical",
}

Related entries