The Space Complexity of Unbounded Timestamps

DOI10.1007/978-3-540-75142-7_19MaRDI QIDQ3523210zbMATH OpenOpenAlexFDO

Authors Faith Ellen, Panagiota Fatourou, Eric Ruppert

Publication date 2 September 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_19

zbMATH Keywords

anonymouslower boundsshared memorytimestamps

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The space complexity of unbounded timestamps
• Bounded Concurrent Time-Stamping
• scientific article; zbMATH DE number 1979529

Cited in

(6)

• Bounded time-stamps
• On the minimal information to encode timestamps in distributed computations.
• Anonymous and fault-tolerant shared-memory computing
• scientific article; zbMATH DE number 1825103 (Why is no real title available?)
• Bounded concurrent timestamp systems using vector clocks
• The space complexity of unbounded timestamps

This page was built for publication: The Space Complexity of Unbounded Timestamps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523210)