Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Spirakis:1987:PCD,
author = "P. Spirakis",
title = "The parallel complexity of deadlock detection",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "1--2",
pages = "155--163",
month = "????",
year = "1987",
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 = "C1160 (Combinatorial mathematics); C4240
(Programming and algorithm theory)",
corpsource = "Courant Inst. of Math. Sci., New York, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; deadlock detection; directed
graphs; directed multigraph problem; distributed
processing; fast parallel algorithms; graph problems;
parallel algorithms; parallel complexity; programming
theory; serially re-usable multi-unit resources",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}