Algebraic spans
Maurice Herlihy; Sergio Rajsbaum;
Algebraic spans
Summary: Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, which is based on a core theorem of algebraic topology, the acyclic carrier theorem, and unifies, generalizes and extends earlier results.
- Brown University United States
- National Autonomous University of Mexico Mexico
distributed computing, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), acyclic carrier theorem
distributed computing, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), acyclic carrier theorem
citations The total number of citations received by all articles of the researcher of interest.55 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
citations
Citations provided by BIP!
The total number of citations received by all articles of the researcher of interest.
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 55
Top 10%
Top 10%
Top 10%
Fields of Science (4) View all
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?