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.
|Number of pages||10|
|State||Published - 1997|
|Event||Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA|
Duration: 21 Aug 1997 → 24 Aug 1997
|Conference||Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing|
|City||Santa Barbara, CA, USA|
|Period||21/08/97 → 24/08/97|