"The Complexity of Strict Serializability Revisited."

Udo Kelter (1987)

Details and statistics

DOI: 10.1016/0020-0190(87)90220-1

access: closed

type: Journal Article

metadata version: 2017-05-26

a service of  Schloss Dagstuhl - Leibniz Center for Informatics