The following pages link to Sorting and Selection in Posets (Q3093615):
Displayed 14 items.
- Succinct posets (Q329288) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Cause I'm a genial imprecise point: outlier detection for uncertain data (Q831712) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- On the use of binary decision diagrams for solving problems on simple games (Q1926964) (← links)
- Scaling limits for width two partially ordered sets: the incomparability window (Q1943695) (← links)
- Pictures from Mongolia. Extracting the top elements from a partially ordered set (Q2272193) (← links)
- On Generalized Comparison-Based Sorting Problems (Q2848974) (← links)
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime (Q2971633) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods (Q6084236) (← links)