Pages that link to "Item:Q1195861"
From MaRDI portal
The following pages link to Some optimal algorithms for decomposed partially ordered sets (Q1195861):
Displaying 11 items.
- Some algorithms based on the dual of Dilworth's theorem (Q1100917) (← links)
- An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains (Q1124331) (← links)
- Computing on-line the lattice of maximal antichains of posets (Q1344242) (← links)
- A Robinson-Schensted algorithm for a class of partial orders (Q1369676) (← links)
- Shared global states in distributed computations (Q1384536) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- String realizers of posets with applications to distributed computing (Q2787668) (← links)
- (Q4781246) (← links)
- (Q5445410) (← links)
- Efficient detection of restricted classes of global predicates (Q6084564) (← links)