Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Reeves:1984:CAE,
author = "C. M. Reeves",
title = "Complexity Analyses of Event Set Algorithms",
journal = j-COMP-J,
volume = "27",
number = "1",
pages = "72--79",
month = feb,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.1.72",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:16 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/27/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/",
note = "See comment \cite{OKeefe:1985:CCA}.",
URL = "http://comjnl.oxfordjournals.org/content/27/1/72.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/72.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/73.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/74.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/75.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/76.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/77.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/78.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_01/tiff/79.tif",
acknowledgement = ack-nhfb,
classcodes = "C4240 (Programming and algorithm theory); C6150J
(Operating systems)",
classification = "723",
corpsource = "Dept. of Computer Sci., Univ. of Keele, Keele, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computational complexity; computer programming;
computer simulation; constant scheduling rate; discrete
event simulation; event scheduling; event set; profile;
scheduling",
treatment = "T Theoretical or Mathematical",
}