Distributed Computing

DOI10.1007/11561927zbMath1171.68363OpenAlexW4245215744MaRDI QIDQ5395146

Hagit Attiya, Danny Hendler

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561927

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Distributed systems (68M14)

Related Items (2)

Tight Bounds for Asynchronous Renaming ⋮ Lower Bounds for Restricted-Use Objects

This page was built for publication: Distributed Computing