Geometric and combinatorial views on asynchronous computability
type: Item
instance of: scholarly article
title: Geometric and combinatorial views on asynchronous computability
zbMATH Open document ID: 1451.68046
author: Samuel Mimram
author: Christine Tasson
author: Éric Goubault
published in: Distributed Computing
publication date: 2018-08-13T00:00:00Z
full work available at URL: mimram views.pdf
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 55U10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 6916821
zbMATH Keywords: fault-tolerant distributed computing
zbMATH Keywords: atomic snapshot protocol
zbMATH Keywords: protocol complex
zbMATH Keywords: directed algebraic topology
zbMATH Keywords: dihomotopy
zbMATH Keywords: interval order
MaRDI profile type: Publication
OpenAlex ID: W2789995574
cites work: Atomic snapshots of shared memory
cites work: Composite registers
cites work: Term Rewriting and All That
cites work: The Read/Write Protocol Complex Is Collapsible
cites work: Q4799892
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
cites work: Trace Spaces: An Efficient New Technique for State-Space Reduction
cites work: Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
cites work: Q4318989
cites work: Algebraic topology and concurrency
cites work: Impossibility of distributed consensus with one faulty process
cites work: Intransitive indifference with unequal indifference intervals
cites work: A geometric view of partial order reduction
cites work: Q3898534
cites work: Some geometric perspectives in concurrency theory
cites work: CONCUR 2005 – Concurrency Theory
cites work: Iterated chromatic subdivisions are collapsible
cites work: Q3625520
cites work: Q5498755
cites work: The asynchronous computability theorem for t-resilient tasks
cites work: The topological structure of asynchronous computability
cites work: Chromatic subdivision of a simplicial complex
cites work: Q3126969
cites work: Q5340517
cites work: Wait-free k-set agreement is impossible
DOI: 10.1007/S00446-018-0328-4
description: scientific article; zbMATH DE number 6916821