Entry Hong:1986:LBC from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Hong:1986:LBC,
author = "J. W. Hong and Q. Zuo",
title = "Lower bounds on communication overlap of networks",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "323--328",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4230 (Switching
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Chicago Univ., IL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "communication overlap; complexity; computational
complexity; graph theory; graph-theoretical invariant;
interconnection network; multiprocessor interconnection
networks; tight lower bounds",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
49(2)171,
49(2)217,
52(3)239,
52(3)251,
54(2)325,
56(2)211,
57(1)97,
57(1)113,
58(1)175,
58(1)263,
60(3)285,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- C4230,
43(2)277,
48(2)135,
54(2)237,
64(1)83,
64(1)125,
64(2)191
- communication,
40(2)101,
45(1)1,
48(1)75,
48(1)109,
49(2)171,
52(3)193,
53(2)169,
53(2)281,
53(2)335,
54(1)53,
57(1)97,
57(2)225,
58(1)183,
61(1)93,
64(1)83,
64(2)175,
64(2)203,
68(2)175
- graph-theoretical,
40(2)257
- interconnection,
48(1)75,
64(1)83,
64(1)125,
64(2)191
- invariant,
36(2)217,
44(1)17,
58(1)347,
59(3)277
- lower,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
43(2)201,
44(3)247,
46(2)329,
47(2)149,
49(2)171,
52(3)239,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
58(1)263,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(2)137,
67(1)115
- multiprocessor,
64(1)83,
64(1)125,
64(2)175,
64(2)191
- network,
36(1)59,
36(1)119,
37(2)183,
38(1)133,
39(2)319,
40(2)101,
40(2)275,
41(1)19,
43(2)277,
44(1)69,
44(3)247,
47(1)15,
48(1)75,
48(2)135,
49(2)171,
49(2)z,
52(3)193,
53(2)281,
54(1)53,
57(1)97,
58(1)183,
61(1)49,
61(2)175,
63(2)223,
64(1)83,
64(1)125,
64(2)191,
64(2)203,
66(1)15,
68(1)19
- switching,
38(1)55,
39(2)337,
43(2)277,
48(1)75,
48(2)135,
53(2)281,
54(2)237,
54(2)277,
64(1)83,
64(1)125,
64(2)191,
64(2)203
- theoretical, graph-,
40(2)257
- tight,
47(2)149