String realizers of posets with applications to distributed computing

DOI10.1145/383962.383988MaRDI QIDQ2787668zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
• Concerning the size of logical clocks in distributed systems
• Some optimal algorithms for decomposed partially ordered sets
• Vector time and causality among abstract events in distributed computations
• Timestamping messages and events in a distributed system using synchronous communication

Cited in

(5)

• Succinct posets
• The complexity of embedding orders into small products of chains
• Word-representable graphs: orientations, posets, and bounds
• Timestamping messages and events in a distributed system using synchronous communication
• Efficient dependency tracking for relevant events in concurrent systems

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

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