Entry Korach:1989:OLB 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{Korach:1989:OLB,
author = "E. Korach and S. Moran and S. Zaks",
title = "Optimal lower bounds for some distributed algorithms
for a complete network of processors",
journal = j-THEOR-COMP-SCI,
volume = "64",
number = "1",
pages = "125--132",
month = apr,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Technion - Israel Inst of Technology",
affiliationaddress = "Haifa, Isr",
classification = "723; 921; C4230 (Switching theory)",
corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Algorithms; complete network of processors; Complete
Networks; Computer Programming; Computer Systems,
Digital--Distributed; distributed algorithms;
Distributed Algorithms; distributed processing; Global
Algorithms; Hamiltonian circuit; leader; Lower Bounds;
Matching Algorithms; Mathematical Techniques--Graph
Theory; maximal matching; multiprocessor
interconnection networks; optimal lower bounds;
spanning tree; synchronous networks",
pubcountry = "Netherlands",
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,
47(3)323,
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(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- C4230,
43(2)277,
47(3)323,
48(2)135,
54(2)237,
64(1)83,
64(2)191
- circuit,
36(2)239,
36(2)333,
38(1)55,
38(2)269,
41(2)141,
43(2)201,
43(2)277,
52(3)239,
57(0)3,
57(1)97,
57(1)113,
61(1)49,
64(3)271,
68(1)19,
68(1)113,
68(3)267
- complete,
35(2)245,
37(1)1,
38(1)55,
38(2)157,
38(2)249,
40(2)85,
41(2)141,
42(2)123,
43(2)189,
44(2)199,
44(3)275,
45(1)1,
46(2)319,
47(1)1,
47(1)27,
47(2)169,
52(3)177,
54(2)199,
56(2)211,
57(2)317,
58(1)129,
63(1)43,
63(3)239,
65(3)343,
67(2)203,
67(2)303,
68(1)37,
68(3)267
- Digital--Distributed,
64(1)67
- distributed,
37(2)183,
39(1)47,
43(2)277,
49(2)145,
49(2)171,
49(2)267,
49(2)z,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
58(0)3,
58(1)249,
61(2)121,
63(1)63,
64(3)221,
64(3)281,
68(2)203
- Distributed, Digital-,
64(1)67
- global,
37(3)357,
44(2)175,
53(2)225,
69(1)1
- Graph, Techniques-,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(2)159,
67(1)5
- Hamiltonian,
41(2)141,
57(1)131,
61(2)121
- interconnection,
47(3)323,
48(1)75,
64(1)83,
64(2)191
- leader,
54(1)53
- 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,
47(3)323,
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(3)331,
66(2)137,
67(1)115
- matching,
41(2)141,
43(2)189,
43(2)239,
51(3)341,
54(1)129,
60(3)231,
61(2)121,
66(1)99
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)239,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- maximal,
36(1)99,
38(1)1,
40(1)3,
43(2)149,
53(2)187,
56(3)339,
58(1)103,
61(1)33,
63(2)157,
64(3)221
- multiprocessor,
47(3)323,
64(1)83,
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,
47(3)323,
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(2)191,
64(2)203,
66(1)15,
68(1)19
- optimal,
39(1)15,
39(1)z,
45(1)63,
53(2)281,
53(2)295,
59(3)259,
59(3)297,
61(1)33,
63(2)203,
64(1)83,
64(2)159,
66(1)105,
66(2)137,
66(2)157,
67(1)5
- processing,
35(2)191,
36(2)173,
37(2)183,
37(3)245,
37(3)305,
39(1)47,
39(2)107,
43(1)31,
43(1)43,
43(2)213,
43(2)277,
48(2)145,
49(2)145,
49(2)171,
49(2)267,
50(3)241,
51(1)239,
52(1)155,
52(3)193,
53(2)281,
54(1)53,
55(2)291,
57(0)3,
57(1)131,
58(1)143,
58(1)183,
58(1)249,
58(1)347,
59(3)259,
59(3)277,
59(3)297,
61(2)121,
61(2)199,
62(1)67,
62(1)123,
62(3)251,
63(1)91,
64(1)83,
64(2)135,
64(2)159,
64(2)175,
64(2)191,
64(3)271,
65(2)249,
66(0)117,
66(2)117,
66(2)181,
68(3)343,
69(1)1
- processor,
37(2)183,
52(3)193,
53(2)169,
54(1)65,
56(1)3,
56(1)17,
56(1)59,
63(3)253
- spanning,
58(1)379
- switching,
38(1)55,
39(2)337,
43(2)277,
47(3)323,
48(1)75,
48(2)135,
53(2)281,
54(2)237,
54(2)277,
64(1)83,
64(2)191,
64(2)203
- synchronous,
47(1)15,
48(2)183,
49(2)145,
49(2)171,
49(2)z,
51(3)281,
52(3)193,
53(2)169,
54(1)53,
58(1)183
- Techniques--Graph,
58(0)3,
58(1)201,
58(1)263,
58(1)325,
61(2)121,
61(2)175,
63(2)223,
63(3)253,
63(3)295,
64(1)83,
64(2)159,
67(1)5