Generalized lattice agreement
DOI10.1145/2332432.2332458zbMATH Open1301.68253OpenAlexW2151102492MaRDI QIDQ2933788FDOQ2933788
Authors: Jose M. Faleiro, Kaushik Rajan, G. Ramalingam, Kapil Vaswani, Sriram K. Rajamani 
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2332432.2332458
Recommendations
- Lattice agreement in message passing systems
- General lattice theory
- On generalized lattices
- scientific article; zbMATH DE number 7650881
- scientific article; zbMATH DE number 3875345
- General theory of lattices
- scientific article; zbMATH DE number 15481
- Generalized cocompact lattices
- Publication:3032311
- Generalized smooth lattices
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cited In (10)
- Lattice agreement in message passing systems
- Byzantine lattice agreement in synchronous message passing systems
- Asynchronous reconfiguration with Byzantine failures
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Split and migrate: Resource-driven placement and discovery of microservices at the edge
- Square principles with tail-end agreement
- Title not available (Why is that?)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Permissionless and asynchronous asset transfer
- Asynchronous reconfiguration with Byzantine failures
This page was built for publication: Generalized lattice agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933788)
