Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)

Author Jennifer L. Welch

Thumbnail PDF


  • Filesize: 155 kB
  • 1 pages

Document Identifiers

Author Details

Jennifer L. Welch
  • Department of Computer Science and Engineering, Texas A&M University, USA

Cite AsGet BibTex

Jennifer L. Welch. Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote). In 22nd International Conference on Principles of Distributed Systems (OPODIS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 125, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


I will provide a historical perspective on wait-free simulations of multi-bit shared registers using single-bit shared registers, starting with classical results from the last century and ending with an overview of the recent resurgence of interest in the topic. Particular emphasis will be placed on the space and step complexities of such simulations.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Distributed Systems


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads