Entry Fle:1985:MSI 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{Fle:1985:MSI,
author = "M. P. Fle and G. Roucairol",
title = "Maximal serializability of iterated transactions",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "1--16",
month = may,
year = "1985",
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 = "C4220 (Automata theory); C4250 (Database theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent transactions; conflicting accesses; correct
behaviours; database consistency; database theory;
dining philosophers; finite automata; finite automaton;
iterated transactions; maximal serialisability;
multiprocessing programs; synchronisation;
synchronization",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}
Related entries
- access,
39(2)89,
58(0)3,
58(1)3,
58(1)379,
61(2)121,
63(2)203
- automaton,
35(1)17,
35(2)313,
36(2)291,
38(1)133,
39(2)171,
40(1)31,
40(2)149,
40(2)163,
47(1)95,
47(3)335,
48(1)117,
53(2)307,
60(3)341,
61(1)17,
63(2)141,
63(2)223,
65(2)123,
66(3)273,
67(1)65
- behaviour,
36(1)21,
38(2)307,
41(1)19,
44(3)275,
47(3)335,
48(1)53,
48(1)95,
48(2)135,
51(3)281,
53(1)151,
54(2)277,
55(1)87,
63(3)303,
64(1)25
- C4250,
35(2)165,
38(1)99,
39(2)239,
39(2)309,
41(2)271,
43(1)81,
46(1)67,
48(2)145,
48(2)297,
52(3)281,
54(1)103,
54(2)299,
56(2)187,
58(1)3,
62(1)3,
62(1)67,
62(1)105,
62(1)187,
62(1)221,
63(1)63,
69(1)1
- concurrent,
36(1)27,
38(2)193,
39(2)107,
40(2)149,
43(2)213,
43(2)277,
45(1)1,
46(2)285,
49(2)185,
50(3)241,
51(3)281,
55(1)1,
55(1)87,
56(1)37,
58(0)3,
58(1)3,
58(1)183,
58(1)263,
58(1)347,
58(1)379,
59(1)25,
60(1)1,
61(1)93,
61(2)121,
64(3)221,
64(3)281,
65(1)35,
66(0)117,
66(2)117,
66(3)333,
69(1)69
- conflicting,
52(1)91
- consistency,
37(1)77,
51(1)129,
62(1)39,
69(3)243
- dining,
36(1)27
- iterated,
38(2)223,
42(3)251,
45(3)293,
48(2)283,
66(1)45
- maximal,
36(1)99,
40(1)3,
43(2)149,
53(2)187,
56(3)339,
58(1)103,
61(1)33,
63(2)157,
64(1)125,
64(3)221
- multiprocessing,
36(1)1,
36(1)27,
38(2)193,
55(1)1
- philosophers,
36(1)27
- serializability,
58(1)3,
69(1)69
- synchronisation,
35(1)43,
37(3)245,
37(3)305,
40(2)301
- synchronization,
35(1)43,
40(2)301,
44(1)69,
50(2)183,
59(1)25,
64(1)25
- transaction,
62(0)3,
62(1)123