Entry Lynch:1988:ITN 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{Lynch:1988:ITN,
author = "Nancy Lynch and Michael Merritt",
title = "Introduction to the theory of nested transactions",
journal = j-THEOR-COMP-SCI,
volume = "62",
number = "1--2",
pages = "123--185",
month = dec,
year = "1988",
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 = "MIT",
affiliationaddress = "Cambridge, MA, USA",
classification = "721; 723; C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conference = "Selected Papers presented at the First International
Conference on Database Theory",
corpsource = "MIT, Cambridge, MA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "Automata Theory; automata theory; Computer
Programming--Algorithms; Concurrency; concurrency;
concurrency control; correctness; Database Systems;
locking algorithm; Locking Algorithms; nested
transactions; Nested Transactions; Resiliency;
resiliency properties; Theory; transaction processing",
meetingaddress = "Rome, Italy",
meetingdate = "Sep 1986",
meetingdate2 = "09/86",
pubcountry = "Netherlands",
sponsor = "European Assoc for Theoretical Computer Science",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Algorithms, Programming-,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- concurrency,
45(1)1,
46(2)261,
49(2)87,
49(2)z,
58(1)3,
59(0)3,
59(1)25,
61(2)199
- control,
35(2)271,
36(2)145,
38(2)193,
39(2)107,
40(2)301,
42(3)251,
52(3)205,
52(3)307,
58(1)3
- correctness,
36(1)127,
37(2)183,
38(2)269,
39(1)47,
39(2)189,
40(2)257,
43(2)123,
50(3)285,
56(1)59,
56(3)345,
59(1)133,
61(2)225,
63(1)91,
67(2)173,
69(2)117
- introduction,
35(2)191,
51(1)229,
54(2)139
- locking,
35(2)129,
58(1)3
- nested,
62(0)3
- 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(3)251,
63(1)91,
64(1)83,
64(1)125,
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
- Programming--Algorithms,
58(0)3,
58(1)3,
58(1)103,
58(1)143,
58(1)183,
59(1)115,
59(3)297,
60(3)255,
60(3)341,
62(0)3,
62(1)67,
62(1)105,
63(2)157,
63(3)295,
64(1)39,
64(1)83,
64(1)107,
64(3)343,
65(1)1,
66(2)157,
66(2)181,
67(1)65
- property,
35(1)109,
35(2)295,
35(2)337,
36(2)217,
36(2)291,
37(1)77,
37(3)305,
38(1)35,
39(1)3,
39(1)z,
39(2)123,
39(2)189,
39(2)281,
39(2)337,
40(2)163,
40(2)211,
40(2)257,
41(2)215,
43(2)277,
43(2)315,
44(1)51,
44(2)127,
46(1)83,
46(2)141,
46(2)175,
46(2)313,
48(1)53,
48(1)75,
49(1)1,
49(1)23,
49(1)43,
51(3)281,
52(1)15,
52(1)165,
52(3)205,
53(1)99,
56(1)3,
57(1)87,
57(2)225,
61(2)103,
61(2)199,
61(2)259,
61(2)283,
62(3)267,
63(1)43,
63(3)303,
63(3)333,
64(1)83,
64(2)191,
64(3)281,
65(2)197,
65(2)221,
65(2)z,
67(1)121,
68(1)1,
68(2)123,
68(3)333
- transaction,
38(1)1,
62(0)3