What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequal-ity tests, comparators and stable sorting functions, each with their own intrinsic characterizations, which in turn provide a basis for run-time monitoring of their expected I/O behaviors. The isomorphisms...
We investigate sorting or typing for Leifer and Milner’s reactive systems. We focus on transferring ...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permu...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) const...
We formulate and study a new computational model for dynamic data. In this model the data changes gr...
AbstractA sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than r...
Sorting and selection are two fundamental problems in theoretical computer science, their optimal so...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
The following five algorithms for sorting in situ are examined: linear insertion sort, cksort, natu...
Sorting algorithms are one of the key pedagogical foundations of computer science, and their propert...
Integrating sorts (types) into logic programming languages increases expressiveness and evaluation e...
A discriminator partitions values associated with keys into groups listed in ascending order. Discri...
Questions about order versus disorder in systems and models have been fascinating scientists over th...
We investigate sorting or typing for Leifer and Milner’s reactive systems. We focus on transferring ...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permu...
AbstractWhat is a sorting function—not a sorting function for a given ordering relation, but a sorti...
We settle a long-standing open question, namely whether it is possible to sort a sequence of n eleme...
Some constraint programming solvers and constraint modelling languages feature the Sort(L,P,S) const...
We formulate and study a new computational model for dynamic data. In this model the data changes gr...
AbstractA sorting algorithm is adaptive if it sorts sequences that are close to sorted faster than r...
Sorting and selection are two fundamental problems in theoretical computer science, their optimal so...
AbstractWe consider a recursive sorting algorithm in which, in each invocation, a new variable and a...
The following five algorithms for sorting in situ are examined: linear insertion sort, cksort, natu...
Sorting algorithms are one of the key pedagogical foundations of computer science, and their propert...
Integrating sorts (types) into logic programming languages increases expressiveness and evaluation e...
A discriminator partitions values associated with keys into groups listed in ascending order. Discri...
Questions about order versus disorder in systems and models have been fascinating scientists over th...
We investigate sorting or typing for Leifer and Milner’s reactive systems. We focus on transferring ...
• We will now undertake a more formal study of algorithms for the sorting problem. • This problem is...
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permu...