Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. Computing the diameter of 17-pancake graph using a PC cluster;Asai,2006
2. An (18/11)n upper bound for sorting by prefix reversals;Chitturi;Theoret. Comput. Sci.,2009
3. On the problem of sorting burnt pancakes;Cohen;Discrete Appl. Math.,1995
4. Problem E2569;Dweighter;Amer. Math. Monthly,1975
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献