We survey recent results on comparison-based sorting problems involving partial orders. In particular, we outline recent algorithms for partial order production and sorting under partial information. We emphasize the complementarity of the two problems and the common aspects of the algorithms. We also include open questions on two other related problems, namely partial order identification and sorting with forbidden comparisons. © Springer-Verlag 2013.SCOPUS: cp.kinfo:eu-repo/semantics/publishe
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...
We revisit the well-known problem of sorting under partial information: sort a finite set given the ...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
We revisit the well-known problem of sorting under partial information: sort a finite set given the ...
We study the generalized sorting problem where we are given a set of n elements to be sorted but onl...
AbstractWe reconsider the old problem of sorting under partial information, and give polynomial time...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
We study the generalized sorting problem where we are given a set of n elements to be sorted but onl...
There are many popular problems in different practical fields of computer sciences, computer network...
Sorting and selection are two fundamental problems in theoretical computer science, their optimal so...
This paper analyses the best methods of sorting on a digital computer. Two main types, “sorting by m...
AbstractA sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than r...
The problem of estimation of the partial order on the basis of multiple pairwise comparisons in bina...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...
We revisit the well-known problem of sorting under partial information: sort a finite set given the ...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
We revisit the well-known problem of sorting under partial information: sort a finite set given the ...
We study the generalized sorting problem where we are given a set of n elements to be sorted but onl...
AbstractWe reconsider the old problem of sorting under partial information, and give polynomial time...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
We study the generalized sorting problem where we are given a set of n elements to be sorted but onl...
There are many popular problems in different practical fields of computer sciences, computer network...
Sorting and selection are two fundamental problems in theoretical computer science, their optimal so...
This paper analyses the best methods of sorting on a digital computer. Two main types, “sorting by m...
AbstractA sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than r...
The problem of estimation of the partial order on the basis of multiple pairwise comparisons in bina...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
What is a sorting function—not a sorting function for a given ordering relation, but a sorting funct...