@inproceedings{7b921dcab0b249eb8f30ccb784e9a5d5,

title = "A gap theorem for consensus types",

abstract = "This paper presents a strong characterization that precisely determines the ability of n-process deterministic types to solve n-process wait-free consensus. This characterization, called the High Gap Theorem, has several important corollaries including a proof that Jayanti's hierarchy that allows multiple copies and read/write shared memory is robust for deterministic types.",

author = "Peterson, {Gary L.} and Bazzi, {Rida A.} and Gil Neiger",

year = "1994",

month = aug,

day = "14",

doi = "10.1145/197917.198123",

language = "English (US)",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "344--353",

booktitle = "Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994",

note = "13th Annual ACM Symposium on Principles of Distributed Computing, PODC 1994 ; Conference date: 14-08-1994 Through 17-08-1994",

}