Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Rosenthal:1981:OAS,
author = "A. Rosenthal",
title = "Optimal algorithms for sensitivity analysis in
associative multiplication problems",
journal = j-THEOR-COMP-SCI,
volume = "14",
number = "1",
pages = "79--90",
month = apr,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Communication Sci., Univ. of
Michigan, Ann Arbor, MI, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph theory; Huffman trees; optimal ordered binary
search trees; optimal strategies; optimisation;
programming theory; sensitivity analysis",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}