On-line sorting of twisted sequences in linear time
From MaRDI portal
Publication:1104753
DOI10.1007/BF01934085zbMATH Open0647.68057MaRDI QIDQ1104753FDOQ1104753
Authors: Franz Aurenhammer 
Publication date: 1988
Published in: BIT (Search for Journal in Brave)
Recommendations
- Tight bounds for online stable sorting
- Online and offline algorithms for the sorting buffers problem on the line metric
- On the time-space tradeoff for sorting with linear queries
- Efficient linear-time ranking and unranking of derangements
- scientific article; zbMATH DE number 522854
- Improved online algorithms for the sorting buffer problem on line metrics
- An algorithm for online topological ordering
- An ${\cal O}(n^{2.75})$ Algorithm for Online Topological Ordering
- On the linear complexity for multidimensional sequences
- scientific article; zbMATH DE number 3983066
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting jordan sequences in linear time using level-linked search trees
Cited In (6)
- New exponential neighbourhood for polynomially solvable TSPs
- Polynomially solvable cases of the bipartite traveling salesman problem
- Simplified linear-time Jordan sorting and polygon clipping
- On Curling Numbers of Integer Sequences
- The travelling salesman and the PQ-tree
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: On-line sorting of twisted sequences in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104753)
