Distributed Computing Through Combinatorial Topology

Index

A

Asynchronous models, 192

Abraham et al., 38, 132

Afek et al., 92, 287

Afek, Gafni, Rajsbaum, Raynal, and Travers, 145

Anderson, 92, 287

Armstrong, 38, 64, 298

Attiya and Castañeda, 189

Attiya and Paz, 244

Attiya and Rajsbaum, 93, 163, 189, 203

Attiya and Welch, 92, 287

Attiya et al., 118, 132, 244, 270

Attiya, Bar-Noy, Dolev, Peleg, and Reischuk, 163

Attiya, Dwork, Lynch, and Stockmeyer, 270

B

Barycentric agreement

for message-passing protocols, 109

Barycentric subdivision, 57

Bondy and Murty, 189

Borowsky and Gafni, 37–38, 92, 117, 144, 163, 188, 203, 244, 270, 287

Borowsky and Gafni (BG)-simulation, 117

code, 142

real model, 141

safe agreement, 140–141

survivor set of simulated processes, 143

Boundary-consistent subdivision of simplices, ...