Simple and efficient bounded concurrent timestamping and the traceable use abstraction
From MaRDI portal
Publication:3158553
DOI10.1145/324133.324161zbMath1065.68501MaRDI QIDQ3158553
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/324133.324161
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68M14: Distributed systems
68W15: Distributed algorithms
Related Items