String realizers of posets with applications to distributed computing

DOI10.1145/383962.383988zbMath1333.68057OpenAlexW2026520803MaRDI QIDQ2787668

Vijay K. Garg, Chakarat Skawratananond

Publication date: 4 March 2016

Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383962.383988

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (4)

Succinct posets ⋮ The complexity of embedding orders into small products of chains ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Timestamping messages and events in a distributed system using synchronous communication

This page was built for publication: String realizers of posets with applications to distributed computing