## AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically

Go Generating

## AI Traceability

AI parses the academic lineage of this thesis

Generate MRT

# On the Optimal Space Complexity of Consensus for Anonymous Processes.

Distributed Computing, no. 4 (2018): 317-326

Cited by: 18|Views30
EI
Full Text
Bibtex

Abstract

The optimal space complexity of consensus in shared memory is a decades-old open problem. For a system of n processes, no algorithm is known that uses a sublinear number of registers. However, the best known lower bound due to Fich, Herlihy, and Shavit requires $\\Omega \\sqrt{n}$ registers. The special symmetric case of the problem whe...More

Code:

Data:

Author