Arrow Research search
Back to MFCS

MFCS 1999

New Perspectives in Distributed Computing

Conference Paper Distributed Computing Algorithms and Complexity ยท Theoretical Computer Science

Abstract

Abstract This is an informal introduction to recent developments in the theory of distributed computing, showing how notions from combinatorial and algebraic topology can be used to capture essential aspects of distributed computing.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Mathematical Foundations of Computer Science
Archive span
1973-2025
Indexed papers
3045
Paper id
237676436320866386