Sorting and selection in posets
From MaRDI portal
Recommendations
Cited in
(24)- On the use of binary decision diagrams for solving problems on simple games
- Scaling limits for width two partially ordered sets: the incomparability window
- Pictures from Mongolia. Extracting the top elements from a partially ordered set
- On generalized comparison-based sorting problems
- Mining posets from linear orders.
- Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Succinct posets
- Sorting and selection in posets
- Improved approximation algorithms for the average-case tree searching problem
- Binary search in graphs revisited
- Towards optimal sorting of 16 elements
- Realization problems on reachability sequences
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods
- Information lattice learning
- Many-sorted equivalence of shiny and strongly polite theories
- An efficient search strategy for hidden ideals in pointed partially ordered sets
- Algorithms for the generalized poset sorting problem
- Many-criteria dominance relations
- On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting
- An optimal algorithm for sorting in trees
- Cause I'm a genial imprecise point: outlier detection for uncertain data
- Progress in presolving for mixed integer programming
- Edge ranking and searching in partial orders
This page was built for publication: Sorting and selection in posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093615)