Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Kruskal:1990:CTE,
author = "C. P. Kruskal and L. Rudolph and M. Snir",
title = "A complexity theory of efficient parallel algorithms",
journal = j-THEOR-COMP-SCI,
volume = "71",
number = "1",
pages = "95--132",
day = "13",
month = mar,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Inst. for Adv. Comput. Studies, Maryland Univ.,
College Park, MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity theory; computational complexity; EP;
parallel algorithms; parallel computation; robustness;
running time; simulating machine",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}