Entry Kessler:1995:GOC 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{Kessler:1995:GOC,
  author =       "Christoph W. Kessler and Thomas Rauber",
  title =        "Generating optimal contiguous evaluations for
                 expression {DAGs}",
  journal =      j-COMP-LANGS,
  volume =       "21",
  number =       "2",
  pages =        "113--127",
  month =        jul,
  year =         "1995",
  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,
  affiliation =  "Universit{\"a}t des Saarlandes",
  affiliationaddress = "Saarbr{\"u}cken, Ger",
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C1160 (Combinatorial mathematics); C6120 (File
                 organisation); C6115 (Programming support); C4240C
                 (Computational complexity)",
  classification = "721.1; 723.1; 723.2; 921.4; 921.5; 922.2",
  corpsource =   "Comput. Sci. Dept., Saarlandes Univ., Saarbrucken,
                 Germany",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "Algorithms; application programs; automatic
                 programming; basic block; Basic blocks; Block codes;
                 code generation; complete search algorithm;
                 Computational complexity; computational complexity;
                 Computer software; Computer software selection and
                 evaluation; directed; Directed acyclic graph; directed
                 acyclic graphs; evaluations; export nodes; expression
                 DAG; graphs; import nodes; labeling scheme; Linear
                 programming; minimal; modified; NP-complete; optimal
                 contiguous evaluations generation; optimising
                 compilers; Optimization; problem; Program compilers;
                 Program optimization; program optimization; Random
                 number generation; redundant; register allocation;
                 Register allocation; register number; searching;
                 storage allocation; tree; trees; Trees (mathematics)",
  treatment =    "P Practical; T Theoretical or Mathematical; X
                 Experimental",
}

Related entries