Entry Louth:1994:CCL from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Louth:1994:CCL,
author = "Graham Louth and Michael Mitzenmacher and Frank
Kelly",
title = "Computational complexity of loss networks",
journal = j-THEOR-COMP-SCI,
volume = "125",
number = "1",
pages = "45--59",
day = "14",
month = mar,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=125&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=125&issue=1&aid=1541",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C5620
(Computer networks and techniques)",
corpsource = "Analysys Ltd., Cambridge, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "blocking probabilities; computational complexity;
computer networks; general loss network; loss networks;
P-complete problem",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- C5620,
84(1)23,
91(1)57,
100(1)223,
108(2)291,
125(1)111,
125(1)149,
125(2)373,
127(2)395,
128(1)31
- complete, P-,
76(2)343,
127(1)181,
127(1)181
- computer,
70(1)3,
71(1)47,
73(1)1,
73(1)101,
74(3)273,
75(1)z,
77(1)73,
77(1)161,
77(1)195,
77(3)321,
79(1)37,
79(1)195,
79(1)209,
84(1)23,
84(1)77,
84(1)127,
86(2)205,
90(1)1,
90(1)253,
91(1)57,
92(1)49,
92(1)77,
94(1)125,
96(1)175,
100(1)223,
102(1)1,
108(2)291,
116(2)227,
116(2)291,
116(2)373,
117(1)z,
119(1)z,
120(2)215,
122(1)1,
123(1)117,
123(1)z,
125(1)111,
125(1)131,
125(1)149,
125(2)373,
127(2)395,
128(1)3,
128(1)31,
130(1)17,
134(1)51,
136(2)387
- general,
75(1)85,
82(1)165,
82(2)215,
84(2)281,
86(2)343,
94(2)281,
97(1)105,
98(1)99,
98(1)137,
99(1)1,
103(2)365,
116(1)195,
117(1)z,
121(1)169,
123(1)31,
129(1)79,
130(1)17,
134(1)107,
135(2)221,
136(1)277
- network,
73(1)61,
74(1)19,
75(3)357,
76(2)331,
80(2)337,
84(1)23,
86(2)343,
87(1)43,
90(2)355,
91(1)57,
91(2)129,
100(1)223,
102(2)329,
102(2)355,
104(2)285,
107(2)305,
108(2)291,
116(2)359,
116(2)415,
120(2)215,
120(2)261,
124(2)329,
125(1)61,
125(1)111,
125(1)149,
125(2)373,
127(2)313,
127(2)395,
128(1)31,
128(1)63,
128(1)127,
130(1)49,
130(1)73,
130(1)175,
131(2)331,
132(1)113,
134(1)51
- P-complete,
76(2)343,
127(1)181,
234(1)325
- probability,
74(2)183,
92(2)249,
93(2)265,
94(2)261,
96(2)389,
100(1)157,
108(2)291,
112(2)383,
113(1)3,
117(1)99,
123(1)131,
123(1)139,
125(1)61,
125(1)111,
125(1)149,
128(1)211,
134(2)529