An (18/11)n upper bound for sorting by prefix reversals

Authors:
B. Chitturi;W. Fahle;Z. Meng;L. Morales;C. O. Shields;I. H. Sudborough;W. Voit
Affiliations:
Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States;Computer Science Department, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX 75080, United States
Venue:
Theoretical Computer Science
Year:
2009

Citing 4
Cited 8

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On the problem of sorting burnt pancakes

Discrete Applied Mathematics
On the diameter of the pancake network

Journal of Algorithms
Computing the Diameters of 14- and 15-Pancake Graphs

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks

Relative-Order Abstractions for the Pancake Problem

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A quadratic lower bound for Topswops

Theoretical Computer Science
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list

FUN'10 Proceedings of the 5th international conference on Fun with algorithms
On average and highest number of flips in pancake sorting

Theoretical Computer Science
Note: Girth of pancake graphs

Discrete Applied Mathematics
Bounding prefix transposition distance for strings and permutations

Theoretical Computer Science
Pancake flipping is hard

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A simplified view of DCJ-indel distance

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	5.23

Visualization

Abstract

The pancake problem asks for the minimum number of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+O(1)~(1.6363)n.