Crash-tolerant causal broadcast in O(n) messages

Birman, 1994, A response to Cheriton and Skeen's criticism of causal and totally ordered communication, Oper. Syst. Rev., 28, 11, 10.1145/164853.164858 Birman, 1991, The ISIS project: real experience with a fault tolerant programming system, 103 Birman, 1987, Reliable communication in the presence of failures, ACM Trans. Comput. Syst., 5, 47, 10.1145/7351.7478 Birman, 1991, Lightweigt causal and atomic group multicast, ACM Trans. Comput. Syst., 9, 272, 10.1145/128738.128742 Cachin, 2011, 10.1007/978-3-642-15260-3 Kshemkalyani, 1998, Necessary and sufficient conditions on information for causal message ordering and their optimal implementation, Distrib. Comput., 11, 91, 10.1007/s004460050044 Lamport, 1978, Time, clocks, and the ordering of events in a distributed system, Commun. ACM, 21, 558, 10.1145/359545.359563 Murty, 1997, Characterization of message ordering specifications and protocols, 492 Peterson, 1989, Preserving and using context information in interprocess communication, ACM Trans. Comput. Syst., 7, 217, 10.1145/65000.65001 Raynal, 2013, 10.1007/978-3-642-38123-2 Raynal, 2018, 10.1007/978-3-319-94141-7 Raynal, 1991, The causal ordering abstraction and a simple way to simple to implement it, Inf. Process. Lett., 39, 343, 10.1016/0020-0190(91)90008-6 Schiper, 1989, A new algorithm to implement causal ordering, vol. 392, 219 Schwarz, 1994, Detecting causal relationships in distributed computations: in: search of the Holy Grail, Distrib. Comput., 7, 149, 10.1007/BF02277859