A. Abdul-Rahman (2005):
A Framework for Decentralised Trust Reasoning.
U. London.
S. Almeida, J. Leitão & L. E. T. Rodrigues (2013):
ChainReaction: A Causal+ Consistent Datastore Based on Chain Replication.
In: Z. Hanzálek, H. Härtig, M. Castro & M. F. Kaashoek: 8th EuroSys.
ACM,
pp. 85–98,
doi:10.1145/2465351.2465361.
P. Bailis (2012):
The Potential Dangers of Causal Consistency and an Explicit Solution.
In: M. J. Carey & S. Hand: 3rd SOCC.
ACM,
pp. 22–1–22–7,
doi:10.1145/2391229.2391251.
I. Ben-Zvi (2010):
Causality, Knowledge and Coordination in Distributed Systems.
Technion.
I. Ben-Zvi & Y. Moses (2010):
Beyond Lamport's Happened-Before: On the Role of Time Bounds in Synchronous Systems.
In: N. A. Lynch & A. A. Shvartsman: 24th DISC,
LNCS 6343.
Springer,
pp. 421–436,
doi:10.1007/978-3-642-15763-9_42.
S. Burckhardt (2014):
Principles of Eventual Consistency.
FTPL 1(1-2),
pp. 1–150,
doi:10.1561/2500000011.
B. Charron-Bost (1991):
Concerning the Size of Logical Clocks in Distributed Systems.
Inf. Proc. Lett. 39(1),
pp. 11–16,
doi:10.1016/0020-0190(91)90055-M.
G. DeCandia (2007):
Dynamo: Amazon's Highly Available Key-Value Store.
In: 21st SOSP,
pp. 205–220,
doi:10.1145/1294261.1294281.
J. Du (2013):
Orbe: Scalable Causal Consistency using Dependency Matrices and Physical Clocks.
In: G. M. Lohman: SOCC.
ACM,
pp. 11:1–11:14,
doi:10.1145/2523616.2523628.
J. Du (2014):
Closing the Performance Gap between Causal Consistency and Eventual Consistency.
In: 1st PaPEC EPFL-CONF-198281.
ACM.
R. Fagin (2003):
Common Knowledge Revisited.
In: V. F. Hendricks, K. F. Jørgensen & S. A. Pedersen: Knowledge Contributors,
Synthese Library 322.
Springer Netherlands,
pp. 87–104,
doi:10.1007/978-94-007-1001-6_5.
S. Gilbert & N. Lynch (2002):
Brewer's Conjecture and the Feasibility of Consistent Available Partition-Tolerant Web Services 33,
pp. 51–59,
doi:10.1145/564585.564601.
Y. A. Gonczarowski & Y. Moses (2013):
Timely Common Knowledge.
In: B. C. Schipper: 14th TARK.
A. Gotsman (2016):
'Cause I'm Strong Enough: Reasoning about Consistency Choices in Distributed Systems.
In: R. Bodík & R. Majumdar: 43rd POPL.
ACM,
pp. 371–384,
doi:10.1145/2837614.2837625.
J. Y. Halpern & Y. Moses (1990):
Knowledge and Common Knowledge in a Distributed Environment.
JACM 37(3),
pp. 549–587,
doi:10.1145/79147.79161.
L. Lamport (1978):
Time, Clocks, and the Ordering of Events in a Distributed System.
Commun. ACM 21(7),
pp. 558–565,
doi:10.1145/359545.359563.
W. Lloyd (2011):
Don't Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS.
In: 23rd SOSP.
ACM,
New York, NY, USA,
pp. 401–416,
doi:10.1145/2043556.2043593.
W. Lloyd (2013):
Stronger Semantics for Low-Latency Geo-Replicated Storage.
In: N. Feamster & J. C. Mogul: 10th NSDI.
USENIX,
pp. 313–328.
F. B Schneider (1990):
Implementing Fault-Tolerant Services using the State Machine Approach: A Tutorial.
ACM CSUR 22(4),
pp. 299–319,
doi:10.1145/98163.98167.
R. Schwarz & F. Mattern (1994):
Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail.
Dist. Comp. 7(3),
pp. 149–174,
doi:10.1007/BF02277859.
P. Sérgio Almeida (2014):
Scalable and Accurate Causality Tracking for Eventually Consistent Stores.
In: 14th IFIP DAIS,
pp. 67–81,
doi:10.1007/978-3-662-43352-2_6.
C. K. Yap (1998):
Theory of Complexity Classes 1.
https://cs.nyu.edu/yap/book/complexity/.
eptcs@eptcs.org