Volume 35, Issue 3 | Distributed Computing

Search all Distributed Computing articles

Volume 35, Issue 3

June 2022

Filter by

Volume:

Sort by

Date published:

New to old Old to new

3 articles in this issue

Sublinear-time distributed algorithms for detecting small cliques and even cycles
Talya Eden
Nimrod Fiat
Rotem Oshman
OriginalPaper 26 November 2021 Pages: 207 - 234
Byzantine gathering in polynomial time
Sébastien Bouchard
Yoann Dieudonné
Anissa Lamani
OriginalPaper 21 January 2022 Pages: 235 - 263
Last-use opacity: a strong safety property for transactional memory with prerelease support
Konrad Siek
Paweł T. Wojciechowski
OriginalPaper Open access 17 April 2022 Pages: 265 - 301