AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen's so-called Principle of Equivalence in mathematical statistics. In the present paper such algorithms are discussed systematically
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
In sorting situations where the final destination of each item is known, it is natural to repeatedly...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
A number of items are arranged in a line. At each unit of time one of the items is requested, the it...
AbstractWe present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sort...
Permutation sorting, one of the fundamental steps in pre-processing data for the efficient applicati...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
In computer science and mathematics we can formulate a procedure for sorting unordered array or a f...
AbstractWe intend to open a new research field towards, say, a theory of “creating order” under vari...
International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed rev...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
In sorting situations where the final destination of each item is known, it is natural to repeatedly...
Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen...
AbstractRecently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre ...
International audienceThis paper proposes new algorithms for computing pairwise rearrangement scenar...
A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomo...
A number of items are arranged in a line. At each unit of time one of the items is requested, the it...
AbstractWe present a solution to a problem posed by Nicolas Lichiardopol, regarding the on-line sort...
Permutation sorting, one of the fundamental steps in pre-processing data for the efficient applicati...
AbstractA simplified form of a sorting machine devised by Armstrong and Rem is defined in this note,...
In computer science and mathematics we can formulate a procedure for sorting unordered array or a f...
AbstractWe intend to open a new research field towards, say, a theory of “creating order” under vari...
International audienceBackgroundTraditional algorithms to solve the problem of sorting by signed rev...
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evo...
AbstractThe problem of sorting a sequence of numbers is considered from the perpective of mathematic...
AbstractA number-theoretical approach to the permutation of a sequence of objects performed by means...
In sorting situations where the final destination of each item is known, it is natural to repeatedly...
DOI
Add to ORKG