Entry OKeefe:1985:CCA from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{OKeefe:1985:CCA,
  author =       "R. M. O'Keefe",
  title =        "Comment on {`Complexity analyses of event set
                 algorithms'}",
  journal =      j-COMP-J,
  volume =       "28",
  number =       "5",
  pages =        "496--497",
  month =        nov,
  year =         "1985",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/28.5.496",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:19 MST 2012",
  bibsource =    "http://comjnl.oxfordjournals.org/content/28/5.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/",
  note =         "See \cite{Reeves:1984:CAE}.",
  URL =          "http://comjnl.oxfordjournals.org/content/28/5/496.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/496.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_05/tiff/497.tif",
  acknowledgement = ack-nhfb,
  classcodes =   "C4240 (Programming and algorithm theory); C7000
                 (Computer applications)",
  corpsource =   "Kent Univ., Canterbury, UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "complexity analyses; computational complexity; digital
                 simulation; discrete-event; event set algorithms;
                 simulations",
  treatment =    "T Theoretical or Mathematical",
}

Related entries