Some optimal algorithms for decomposed partially ordered sets
type: Item
instance of: scholarly article
title: Some optimal algorithms for decomposed partially ordered sets
zbMATH Open document ID: 0764.68070
DOI: 10.1016/0020-0190(92)90253-R
author: Vijay K. Garg
published in: Information Processing Letters
publication date: 1993-01-04T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 86089
zbMATH Keywords: distributed computing
zbMATH Keywords: partially ordered sets
zbMATH Keywords: optimal algorithm
zbMATH Keywords: distributed debugging
MaRDI profile type: Publication
cites work: Recovery in distributed systems using optimistic message logging and checkpointing
full work available at URL: 0020-0190(92)90253-r
OpenAlex ID: W2042107594
Recommended article: Q4798662
Recommended article: Algorithms over partially ordered sets
Recommended article: Q4815956
Recommended article: Decompositions of partially ordered sets
Recommended article: Efficient splitting and merging algorithms for order decomposable problems
Recommended article: On a universal best choice algorithm for partially ordered sets
Recommended article: Efficient splitting and merging algorithms for order decomposable problems.
Recommended article: An optimal algorithm to find the jump number of partially ordered sets
Recommended article: Algorithms for Dualization over Products of Partially Ordered Sets
Recommended article: On the complexity of sorting Cartesian products of partially ordered sets
description: scientific article; zbMATH DE number 86089