Entry Schmid:1995:RTQ from tcs1995.bib

Last update: Sun Oct 15 02:56:11 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Schmid:1995:RTQ,
  author =       "U. Schmid",
  title =        "Random trees in queueing systems with deadlines",
  journal =      j-THEOR-COMP-SCI,
  volume =       "144",
  number =       "1--2",
  pages =        "277--314",
  day =          "26",
  month =        jun,
  year =         "1995",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Mon Jul 19 22:19:10 MDT 1999",
  bibsource =    "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=144&issue=1-2;
                 http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
  URL =          "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=144&issue=1-2&aid=1916",
  acknowledgement = ack-nhfb,
  classification = "B0240C (Queueing theory); B0250 (Combinatorial
                 mathematics); C1140C (Queueing theory); C1160
                 (Combinatorial mathematics); C4210 (Formal logic)",
  corpsource =   "Dept. of Autom., Tech. Univ. Wien, Austria",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "aperiodic tasks; asymptotic methods; deadline meeting
                 properties; discrete-time single-server queueing
                 system; queueing systems; queueing theory; random
                 trees; scheduling; scheduling algorithms; trees
                 (mathematics)",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries