scientific article
From MaRDI portal
Publication:2766858
zbMath0987.68505MaRDI QIDQ2766858
Publication date: 25 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (3)
Performing work in broadcast networks ⋮ Hundreds of impossibility results for distributed computing ⋮ A simple proof of the uniform consensus synchronous lower bound.
This page was built for publication: