Add to ORKGThe direct application of the definition of sorting in lattices [1] is im-practical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a sequence. This alternative formulation is inspired by the identit
The lattice Ais an important lattice because of its covering properties in low dimensions. Two algor...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type...
In this paper we revisit the foundations of formal concept analysis for ordered contexts of [4]. Fro...
Abstract In a totally ordered set the notion of sorting a finite sequence is de-fined through the ex...
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permu...
AbstractWe present a new sorting algorithm that adapts to existing order within an input sequence. L...
AbstractA new class of distributive partitioning sort algorithms is proposed, in which the number of...
AbstractThis paper discusses the structure of sort (or is-a) hierarchies. The effect of different ki...
In this paper, we consider the representation and management of an element set on which a lattice pa...
AbstractThe paper is concerned with the problem of computing the number of elements of a free distri...
The lattice A*n is an important lattice because of its covering properties in low dimensions. Two al...
AbstractFrom a well-known decomposition theorem, we propose a tree representation for distributive a...
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed...
AbstractWe present several efficient algorithms on distributive lattices. They are based on a compac...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
The lattice Ais an important lattice because of its covering properties in low dimensions. Two algor...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type...
In this paper we revisit the foundations of formal concept analysis for ordered contexts of [4]. Fro...
Abstract In a totally ordered set the notion of sorting a finite sequence is de-fined through the ex...
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permu...
AbstractWe present a new sorting algorithm that adapts to existing order within an input sequence. L...
AbstractA new class of distributive partitioning sort algorithms is proposed, in which the number of...
AbstractThis paper discusses the structure of sort (or is-a) hierarchies. The effect of different ki...
In this paper, we consider the representation and management of an element set on which a lattice pa...
AbstractThe paper is concerned with the problem of computing the number of elements of a free distri...
The lattice A*n is an important lattice because of its covering properties in low dimensions. Two al...
AbstractFrom a well-known decomposition theorem, we propose a tree representation for distributive a...
We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed...
AbstractWe present several efficient algorithms on distributive lattices. They are based on a compac...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
The lattice Ais an important lattice because of its covering properties in low dimensions. Two algor...
We present a complete formalisation of bitonic sort and its correctness proof in constructive type...
In this paper we revisit the foundations of formal concept analysis for ordered contexts of [4]. Fro...