Towards a topological characterization of asynchronous complexity

Gunnar Hoest, Nir Shavit

Research output: Contribution to conferencePaperpeer-review

Abstract

The use of topological models and methods as tools for the quantification and classification of asynchronous complexity is introduced. The first asynchronous complexity theorem, applied to decision tasks in a generalization of Borowsky and Gafni's Iterated Immediate Snapshot (IIS) model is presented. A novel form of span called the non-uniform chromatic subdivision is presented.

Original languageEnglish
Pages199-208
Number of pages10
DOIs
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA
Duration: 21 Aug 199724 Aug 1997

Conference

ConferenceProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
CitySanta Barbara, CA, USA
Period21/08/9724/08/97

Cite this