Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Erdos:1999:FLS,
author = "P{\'e}ter L. Erd{\H{o}}s and Michael A. Steel and
L{\'a}szl{\'o} A. Sz{\'e}kely and Tandy J. Warnow",
title = "A few logs suffice to build (almost) all trees: {Part
II}",
journal = j-THEOR-COMP-SCI,
volume = "221",
number = "1--2",
pages = "77--118",
day = "28",
month = jun,
year = "1999",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:22:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1999&volume=221&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=1999&volume=221&issue=1-2&aid=3189",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}