Entry Naughton:1995:ARF from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

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{Naughton:1995:ARF,
  author =       "J. F. Naughton and R. Ramakrishnan and Y. Sagiv and J.
                 D. Ullman",
  title =        "Argument reduction by factoring",
  journal =      j-THEOR-COMP-SCI,
  volume =       "146",
  number =       "1--2",
  pages =        "269--310",
  day =          "24",
  month =        jul,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:14 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=146&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=146&issue=1-2&aid=1820",
  acknowledgement = ack-nhfb,
  classification = "C1180 (Optimisation techniques); C4210 (Formal
                 logic); C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "argument reduction; factoring; Magic Sets
                 transformation; optimisation; optimization; predicate;
                 programming theory; recursive functions; recursive
                 predicate; rewriting systems; separable recursions",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
  xxauthor =     "J. F. Naughton and P. Ramakrishnan and Y. Sagiv and J.
                 D. Ullman",
}

Related entries