Entry Coffin:1989:SAM from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
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{Coffin:1989:SAM,
author = "Michael Coffin and Ronald A. Olsson",
title = "An {SR} approach to multiway rendezvous",
journal = j-COMP-LANGS,
volume = "14",
number = "4",
pages = "255--262",
month = "????",
year = "1989",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Arizona",
affiliationaddress = "Tucson, AZ, USA",
classcodes = "C6150J (Operating systems); C6140D (High level
languages)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Computer Programming Languages; Computer
Programming--Algorithms; concurrency control;
concurrent program languages; Concurrent Programming
Languages; high level languages; multiprocessing;
Multiway Rendezvous; multiway rendezvous problems;
program; programs; SR language; SR Programming
Language; structure; synchronisation; Synchronization",
treatment = "P Practical",
}
Related entries
- Algorithms, Programming-,
14(2)93,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)263,
15(2)83,
15(2)109,
16(3)235
- approach,
1(2)151,
1(3)255,
4(1)29,
4(1)49,
5(1)29,
5(3)141,
11(1)15,
15(1)1,
17(1)39,
19(1)19,
20(2)101,
20(3)177,
31(2)49,
32(1)42,
36(3)288,
39(3)95,
44(z)199,
44(z)283,
44(z)299,
45(z)35,
45(z)199,
45(z)204,
45(z)283,
45(z)299,
49(z)133,
50(z)1,
50(z)127,
51(z)71,
53(z)43,
54(z)297,
54(z)358
- concurrency,
7(1)21,
8(1)15,
8(2)61,
9(2)97,
12(1)27,
13(1)31,
15(2)95,
17(2)83,
19(1)51,
19(3)185,
22(1)15,
22(2)79,
28(4)307,
38(3)242
- concurrent,
2(3)75,
5(3)163,
8(2)61,
9(3)183,
14(1)1,
14(4)263,
15(3)153,
15(3)163,
16(1)5,
17(4)213,
17(4)269,
18(3)153,
18(3)185,
19(1)51,
19(3)185,
20(4)253,
21(3)147,
22(1)15,
22(4)193,
22(4)237,
22(4)259,
23(1)1,
23(1)43,
23(2)87,
24(4)245,
25(3)119,
35(3)293,
44(z)319,
45(z)319,
47(z)170
- control,
1(1)3,
3(3)163,
4(3)155,
5(3)141,
6(3)131,
7(2)89,
8(1)1,
8(1)15,
8(2)61,
9(1)1,
9(3)133,
9(3)183,
10(2)75,
10(3)179,
11(3)143,
12(1)39,
13(3)109,
14(1)1,
14(3)153,
15(2)83,
15(2)109,
15(3)141,
16(1)39,
16(2)147,
16(3)197,
17(4)269,
18(4)217,
19(1)51,
20(1)53,
20(2)117,
21(1)17,
22(1)15,
22(4)259,
23(2)87,
24(4)229,
39(3)67,
39(3)109,
45(z)80,
45(z)161,
47(z)44
- multiprocessing,
3(4)209,
4(4)209,
7(1)21,
8(2)61,
10(1)43,
12(1)27,
14(4)263,
15(2)109,
16(1)5,
17(1)61,
20(3)135,
20(3)151,
22(2)181,
22(4)205
- multiway,
15(2)109
- Olsson, Ronald A.,
15(3)163,
17(4)269,
21(1)17,
28(4)307,
28(4)327,
29(4)75,
35(3)293
- problem,
1(1)61,
1(1)83,
1(2)161,
1(3)197,
1(3)255,
1(4)321,
2(1)1,
2(3)75,
3(1)53,
3(3)145,
3(3)193,
4(1)17,
4(3)187,
5(3)155,
7(3)125,
8(2)69,
8(3)95,
11(3)161,
12(1)9,
14(1)11,
14(3)137,
14(3)153,
16(1)97,
16(3)235,
19(3)157,
19(3)169,
19(3)205,
20(3)177,
21(2)113,
22(1)27,
22(4)259,
23(1)25,
23(1)43,
23(2)61,
24(1)1,
26(2)165
- Programming--Algorithms,
14(2)93,
14(2)99,
14(2)109,
14(2)125,
14(3)181,
14(4)239,
14(4)263,
15(2)83,
15(2)109,
16(3)235
- SR,
15(3)163,
22(4)259,
28(4)307
- synchronisation,
11(3)155,
16(1)5,
22(1)15,
22(4)205,
22(4)259
- synchronization,
8(2)51,
10(1)43,
11(3)155,
16(1)5,
21(3)147,
22(1)15,
22(4)205,
22(4)259,
25(3)165