Page "Pancake sorting" Paragraph 4

On September 17, 2008, a team of researchers at the University of Texas at Dallas led by Founders Professor Hal Sudborough announced the acceptance by the journal Theoretical Computer Science of a more efficient algorithm for pancake sorting than the one proposed by Gates and Papadimitriou.

This establishes a new upper bound of ( 18 / 11 ) n, improving upon the existing bound of ( 5 / 3 ) n from 1979.