Some optimal algorithms for decomposed partially ordered sets

DOI10.1016/0020-0190(92)90253-RzbMath0764.68070OpenAlexW2042107594MaRDI QIDQ1195861

Vijay K. Garg

Publication date: 4 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90253-r

zbMATH Keywords

partially ordered setsoptimal algorithmdistributed computingdistributed debugging

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07)

Related Items (2)

Shared global states in distributed computations ⋮ Efficient detection of restricted classes of global predicates

Cites Work

• Recovery in distributed systems using optimistic message logging and checkpointing

This page was built for publication: Some optimal algorithms for decomposed partially ordered sets