Entry Schmid:1995:RTQ from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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
- aperiodic,
145(1)229,
154(1)67,
163(1)291,
209(1)299
- asymptotic,
143(2)343,
144(1)3,
144(1)101,
144(1)161,
147(1)31,
147(1)267,
149(1)67,
156(1)301,
159(1)65,
164(1)185,
164(1)277,
181(2)307,
187(1)81,
187(1)263,
190(2)151,
215(1)371,
218(2)249
- B0240C,
155(1)141
- B0250,
141(1)133,
141(1)351,
143(1)93,
144(1)3,
144(1)67,
144(1)161,
148(1)121,
148(1)165,
152(2)305,
153(1)129,
153(1)171,
153(1)245,
154(2)165,
156(1)263,
159(1)29,
172(1)121,
174(1)97,
176(1)347,
178(1)103,
181(1)181,
187(1)49,
187(1)167,
188(1)231,
191(1)157
- C1140C,
155(1)141,
177(2)487,
182(1)145,
182(1)203
- deadline,
215(1)209
- discrete-time,
221(1)369
- queueing,
155(1)141,
177(2)487,
182(1)145,
182(1)203
- random,
143(1)73,
144(1)67,
144(1)125,
145(1)381,
147(1)267,
148(1)19,
152(2)171,
152(2)219,
154(1)23,
156(1)301,
159(1)5,
159(1)29,
159(1)43,
162(1)151,
162(2)341,
164(1)107,
169(2)147,
175(2)393,
178(1)155,
190(2)151,
191(1)185,
196(1)3,
196(1)109,
201(1)281,
207(2)343,
207(2)387,
215(1)1,
218(2)219,
218(2)233,
218(2)263,
219(1)287,
226(1)29,
229(1)103
- scheduling,
145(1)329,
147(1)1,
162(2)225,
162(2)323,
162(2)341,
164(1)73,
173(1)209,
174(1)193,
178(1)119,
178(1)265,
181(2)357,
183(2)281,
191(1)205,
196(1)347,
196(1)395,
215(1)137,
215(1)209,
220(1)157
- task,
145(1)271,
162(2)323,
171(1)111,
174(1)193,
178(1)119,
194(1)163,
196(1)319,
196(1)347,
215(1)209