Entry Karpinski:1997:CCO 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{Karpinski:1997:CCO,
  author =       "Marek Karpinski and Lawrence L. Larmore and Wojciech
                 Rytter",
  title =        "Correctness of constructing optimal alphabetic trees
                 revisited",
  journal =      j-THEOR-COMP-SCI,
  volume =       "180",
  number =       "1--2",
  pages =        "309--324",
  day =          "10",
  month =        jun,
  year =         "1997",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:20:59 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=180&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=1997&volume=180&issue=1-2&aid=2496",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory); C6110F
                 (Formal methods); C6150G (Diagnostic, testing,
                 debugging and evaluating systems)",
  corpsource =   "Dept. of Comput. Sci., Bonn Univ., Germany",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "correctness proofs; Garsia-Wachs algorithm; Hu-Tucker
                 algorithm; optimal alphabetic trees; program
                 verification; programming theory",
  pubcountry =   "Netherlands",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries