Journal of the ACM Bibliography
Christos H.
Papadimitriou. The serializability of concurrent database updates.
Journal of the ACM, 26(4):631-653, October 1979.
[BibTeX entry]
Selected papers that cite this one
- D. Agrawal and A. El Abbadi. Constrained shared
locks for increasing concurrency in databases. Journal of
Computer and System Sciences, 51(1):53-63, August 1995.
- Jürgen Ebert and Gottfried Vossen. I-serializability:
Generalized correctness for transaction-based environments.
Information Processing Letters, 63(4):221-227, 28 August
1997.
- Phillip B. Gibbons and Ephraim Korach. Testing shared
memories. SIAM Journal on Computing, 26(4):1208-1244,
August 1997.
- V. Krishnaswamy, D. Agrawal, J. L. Bruno, and A. El Abbadi. Relative
serializability: An approach for relaxing the atomicity of
transactions. Journal of Computer and System Sciences,
55(2):344-354, October 1997.
- Georg Lausen and Eljas Soisalon-Soininen. Safety by uninterpreted locks.
Information and Computation, 117(1):37-49, 15 February
1995.
- Georg Lausen, Eljas Soisalon-Soininen, and Peter Widmayer. Pre-analysis locking.
Information and Control, 70(2/3):193-215, August/September
1986.
- Witold Lipski, Jr. and Christos H. Papadimitriou. A fast algorithm for
testing for safety and detecting deadlocks in locked transaction
systems. Journal of Algorithms, 2(3):211-226, September
1981.
- Gil Neiger and Sam Toueg. Simulating synchronized clocks and
common knowledge in distributed systems. Journal of the
ACM, 40(2):334-367, April 1993.
- Christos H. Papadimitriou. A theorem in database
concurrency control. Journal of the ACM,
29(4):998-1006, October 1982.
Shortcuts: