SOFSEM 2005: Theory and Practice of Computer Science
From MaRDI portal
Publication:5711542
DOI10.1007/B105088zbMath1117.68320OpenAlexW2543951292MaRDI QIDQ5711542
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105088
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (5)
Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method ⋮ The complexity of updating snapshot objects ⋮ Help when needed, but no more: efficient read/write partial snapshot ⋮ Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science
