How a rainbow coloring function can simulate wait-free handshaking (Q5096913): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-58338-6_101 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1586987337 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time-Lapse Snapshots / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Simple and efficient bounded concurrent timestamping and the traceable use abstraction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The file distribution problem for processor networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal multi-writer multi-reader atomic register / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On interprocess communication. I: Basic formalism / rank | |||
Normal rank | |||
Latest revision as of 21:46, 29 July 2024
scientific article; zbMATH DE number 7573217
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How a rainbow coloring function can simulate wait-free handshaking |
scientific article; zbMATH DE number 7573217 |
Statements
How a rainbow coloring function can simulate wait-free handshaking (English)
0 references
18 August 2022
0 references
