Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Pancake problems with restricted prefix reversals and some corresponding Cayley networks;Bass;J. Parallel Distrib. Comput.,2003
2. On some tighter inapproximability results;Berman,1999
3. Pancake flipping is hard;Bulteau,2012
4. An (18/11)n upper bound for sorting by prefix reversals;Chitturi;Theoret. Comput. Sci.,2009
5. On average and highest number of flips in pancake sorting;Cibulka;Theoret. Comput. Sci.,2011
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献