Sorting Using Networks of Queues and Stacks
From MaRDI portal
Publication:5654999
DOI10.1145/321694.321704zbMath0243.68004OpenAlexW2017788080WikidataQ60638471 ScholiaQ60638471MaRDI QIDQ5654999
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321694.321704
Formal languages and automata (68Q45) Deterministic network models in operations research (90B10) General topics in the theory of software (68N01)
Related Items (max. 100)
Algorithms for the fixed linear crossing number problem ⋮ 2-stack sorting is polynomial ⋮ Pattern matching for permutations ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers ⋮ Parameterized Algorithms for Queue Layouts ⋮ Labelled well-quasi-order for permutation classes ⋮ An infinite antichain of planar tanglegrams ⋮ A survey on book-embedding of planar graphs ⋮ Permutations sortable by deques and by two stacks in parallel ⋮ Signed enumeration of upper-right corners in path shuffles ⋮ Sorting by shuffling methods and a queue ⋮ Permutation pattern avoidance and the Catalan triangle ⋮ Embedding planar graphs in four pages ⋮ Sorting with networks of data structures ⋮ Optimum embedding of complete graphs in books ⋮ How to sort by walking and swapping on paths and trees ⋮ Queue layouts of iterated line directed graphs ⋮ Permutations generated by token passing in graphs ⋮ Sorting using networks of deques ⋮ On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ Unnamed Item ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Succinct representation of labeled graphs ⋮ Stieltjes moment sequences for pattern-avoiding permutations ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Passing through a stack k times ⋮ Regular closed sets of permutations. ⋮ Operators of equivalent sorting power and related Wilf-equivalences ⋮ Graph layouts via layered separators ⋮ Succinct Representation of Labeled Graphs ⋮ Permutations generated by stacks and deques ⋮ Approximating the fixed linear crossing number ⋮ Preimages under the Queuesort algorithm ⋮ Pattern matching for permutations ⋮ Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations ⋮ Restricted permutations ⋮ An analysis of some linear graph layout heuristics ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ The enumeration of permutations sortable by pop stacks in parallel ⋮ On dispersable book embeddings ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ Queue layouts of planar 3-trees ⋮ New equivalences for pattern avoiding involutions ⋮ Priority queues with binary priorities ⋮ Queue layouts of planar 3-trees ⋮ Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms ⋮ Stack sorting with increasing and decreasing stacks ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Finding and counting permutations via CSPs ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Two first-order logics of permutations ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ Passing through a stack \(k\) times with reversals ⋮ Packing sets of patterns ⋮ Almost avoiding permutations ⋮ Average-case analysis of algorithms using Kolmogorov complexity ⋮ Book Embeddings of Regular Graphs ⋮ Sorting with two ordered stacks in series. ⋮ Parameterized Algorithms for Queue Layouts ⋮ Two-stack-sorting with pop stacks
This page was built for publication: Sorting Using Networks of Queues and Stacks
