AbstractWe present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sorting of a sequence of integers
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
AbstractAn algorithm is described which sorts n numbers in place with the property of stability, i.e...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
AbstractWe present a fast deterministic algorithm for integer sorting in linear space. Our algorithm...
Sorting is one of the fundamental problems in computer science. In this thesis we present three indi...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
Given a sequence A of 2n real numbers, the \ers\ problem asks for the sum of the n values that are a...
Recently, Howard Bergerson proposed the following research problem in logology: I have had one resea...
AbstractThe problem of minimum-comparison-merging is solved for the case of one 4-element and one ar...
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
AbstractAn algorithm is described which sorts n numbers in place with the property of stability, i.e...
Sorting with stacks is a collection of problems that deal with sorting a sequence of numbers by push...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
AbstractWe define a sorting problem on an n element set S to be a family 〈A1,…,Ar〉 of disjoint subse...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
AbstractThis paper addresses the following question: What is the complexity of sorting n numbers x1,...
AbstractThe main result of the paper is that if n is sufficiently large and 2⩽r=r(n)⩽log log log n t...
AbstractWe present a fast deterministic algorithm for integer sorting in linear space. Our algorithm...
Sorting is one of the fundamental problems in computer science. In this thesis we present three indi...
AbstractIn this paper we present an O(n2) implementation of Moore's algorithm for automata minimizat...
Given a sequence A of 2n real numbers, the \ers\ problem asks for the sum of the n values that are a...
Recently, Howard Bergerson proposed the following research problem in logology: I have had one resea...
AbstractThe problem of minimum-comparison-merging is solved for the case of one 4-element and one ar...
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractThe number of required deques for sorting all sequences of n items in a parallel or series n...
AbstractAn algorithm is described which sorts n numbers in place with the property of stability, i.e...