How a rainbow coloring function can simulate wait-free handshaking

DOI10.1007/3-540-58338-6_101zbMath1493.68034OpenAlexW1586987337MaRDI QIDQ5096913

Marina Papatriantafilou, Philippas Tsigas

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_101

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Cites Work

• On interprocess communication. I: Basic formalism
• Simple and efficient bounded concurrent timestamping and the traceable use abstraction
• Time-Lapse Snapshots
• The file distribution problem for processor networks
• Optimal multi-writer multi-reader atomic register

This page was built for publication: How a rainbow coloring function can simulate wait-free handshaking