Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Johnson:1986:SPT,
author = "D. B. Johnson",
title = "A simple proof of a time-space trade-off for sorting
with linear comparisons",
journal = j-THEOR-COMP-SCI,
volume = "43",
number = "2--3",
pages = "345--350",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Math., Dartmouth Coll., Hanover, NH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; linear branching programs;
sorting; sorting with linear comparisons; time-space
trade-off",
pubcountry = "Netherlands A14",
treatment = "T Theoretical or Mathematical",
}