Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
No label defined
(Q3305190)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
No label defined
scientific article
Statements
instance of
scholarly article
0 references
author
Sergio Rajsbaum
0 references
Michel Raynal
0 references
Maurice P. Herlihy
0 references
publication date
6 August 2020
0 references
full work available at URL
https://miscelaneamatematica.org/welcome/default/download/tbl_articulos.pdf2.932442bf45e242c3.353630362e706466.pdf
0 references
MaRDI profile type
MaRDI publication profile
0 references
cites work
Atomic snapshots of shared memory
0 references
The \(k\)-simultaneous consensus problem
0 references
Renaming in an asynchronous environment
0 references
Atomic Snapshots in <i>O</i> (<i>n</i> log <i>n</i>) Operations
0 references
The Combinatorial Structure of Wait-Free Solvable Tasks
0 references
A combinatorial characterization of the distributed 1-solvable tasks
0 references
Immediate atomic snapshots and fast renaming
0 references
Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations
0 references
The BG distributed simulation algorithm
0 references
The renaming problem in shared memory systems: an introduction
0 references
The Heard-Of model: computing in distributed systems with benign faults
0 references
More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
0 references
Reaching approximate agreement in the presence of faults
0 references
Impossibility of distributed consensus with one faulty process
0 references
Locality and Checkability in Wait-Free Computing
0 references
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
0 references
Three-Processor Tasks Are Undecidable
0 references
A classification of wait-free loop agreement tasks
0 references
Unifying synchronous and asynchronous message-passing models
0 references
The topological structure of asynchronous computability
0 references
Q4527026
0 references
Help when needed, but no more: efficient read/write partial snapshot
0 references
Combinatorial algebraic topology
0 references
On interprocess communication. I: Basic formalism
0 references
The Byzantine Generals Problem
0 references
Classifying rendezvous tasks of arbitrary dimension
0 references
Q3126969
0 references
Q4286756
0 references
A Layered Analysis of Consensus
0 references
The Iterated Restricted Immediate Snapshot Model
0 references
Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge
0 references
Q3392273
0 references
Identifiers
zbMATH Open document ID
1439.68030
0 references
Mathematics Subject Classification ID
68W15
0 references
68M14
0 references
zbMATH DE Number
7228882
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:3305190
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
