Sorting and Selection in Posets
From MaRDI portal
Publication:3093615
DOI10.1137/070697720zbMath1232.68034OpenAlexW2111658460MaRDI QIDQ3093615
Elchanan Mossel, Elad Verbin, Samantha J. Riesenfeld, Constantinos Daskalakis, Richard M. Karp
Publication date: 18 October 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/statistics_papers/410
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics of partially ordered sets (06A07)
Related Items (14)
Cause I'm a genial imprecise point: outlier detection for uncertain data ⋮ Succinct posets ⋮ On the use of binary decision diagrams for solving problems on simple games ⋮ A tutorial on multiobjective optimization: fundamentals and evolutionary methods ⋮ Scaling limits for width two partially ordered sets: the incomparability window ⋮ Progress in presolving for mixed integer programming ⋮ Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ Many-sorted equivalence of shiny and strongly polite theories ⋮ Pictures from Mongolia. Extracting the top elements from a partially ordered set ⋮ Realization problems on reachability sequences ⋮ Binary Search in Graphs Revisited ⋮ On Generalized Comparison-Based Sorting Problems
This page was built for publication: Sorting and Selection in Posets
