Related papers: A stack and a pop stack in series
This paper introduces a new comparison base stable sorting algorithm, named RS sort. RS Sort involves only the comparison of pair of elements in an array which ultimately sorts the array and does not involve the comparison of each element…
A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmovi\'c and Wood in 2005, was "half-answered" by Dujmovi\'c, Eppstein, Hickingbotham, Morin and Wood in 2022; they…
We use stack words to find a new, simple proof for the best known upper bound for the number of 3-stack sortable permutations of a given length. This is the first time that stack words are used to obtain such a result.
This work presents a comparison for the performance of sequential sorting algorithms under four different modes of execution, the sequential processing mode, a conventional multi-threading implementation, multi-threading with OpenMP Library…
In this paper we give an overview of the graph invariants queue number and stack number (the latter also called the page number or book thickness). Due to their similarity, it has been studied for a long time, whether one of them is bounded…
The Gibbs Mixing Paradox is a conceptual touchstone for understanding mixtures in statistical mechanics. While debates over the theoretical subtleties of particle distinguishability continue to this day, we seek to extend the discussion in…
We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
We present a deterministic oblivious LIFO (Stack), FIFO, double-ended and double-ended priority queue as well as an oblivious mergesort and quicksort algorithm. Our techniques and ideas include concatenating queues end-to-end, size…
In sorting literature, comparative statics for multidimensional assignment models with general output functions and input distributions is an important open question. We provide a complete theory of comparative statics for technological…
We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length…
A matching queue is described via a graph $G$ together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can either be queued, or matched with queued items in neighboring…
In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were…
We theoretically predict and experimentally demonstrate that several different particle species can be separated from each other by means of a ratchet device, consisting of periodically arranged triangular (ratchet) shaped obstacles. We…
In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
Multi-stack machines and Turing machines can simulate to each other. In this note, we give a succinct definition of multi-stack machines, and from this definition it is clearly seen that pushdown automata and deterministic finite automata…
We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i. e; number of digits…